{"id":"https://openalex.org/W2131409447","doi":null,"title":"Approximate Scalable Bounded Space Sketch for Large Data NLP","display_name":"Approximate Scalable Bounded Space Sketch for Large Data NLP","publication_year":2012,"publication_date":"2012-05-06","ids":{"openalex":"https://openalex.org/W2131409447","mag":"2131409447"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.3335","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.3335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal3.name/docs/daume11sketch.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Amit Goyal","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amit Goyal","raw_affiliation_strings":["University of Maryland  College Park MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland  College Park MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019928111","display_name":"Hal Daum\u00e9","orcid":"https://orcid.org/0000-0002-3760-345X","observed_orcids":["https://orcid.org/0000-0002-3760-345X"]},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hal Daum\u00e9 Iii","raw_affiliation_strings":["University of Maryland  College Park MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland  College Park MD","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":3.2248,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.91666667,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6128000020980835,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6128000020980835,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.19689999520778656,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.07840000092983246,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/count-min-sketch","display_name":"Count-Min Sketch","score":0.9750000238418579},{"id":"https://openalex.org/keywords/space-efficient-algorithms","display_name":"memory-efficient algorithms","score":0.5630000233650208},{"id":"https://openalex.org/keywords/large-scale-text-data","display_name":"large-scale text data","score":0.5559999942779541},{"id":"https://openalex.org/keywords/web-corpus","display_name":"web corpus","score":0.4860000014305115}],"concepts":[{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.899456262588501},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7150318026542664},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7123558521270752},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.7116483449935913},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6686102747917175},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6169531941413879},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5865681767463684},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5390194654464722},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5038644671440125},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.44806987047195435},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3294109106063843},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2020840346813202},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1790497899055481},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12441378831863403},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09516754746437073},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.3335","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.3335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal3.name/docs/daume11sketch.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.227.2223","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.2223","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://aclweb.org/anthology-new/D/D11/D11-1023.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W4518955","https://openalex.org/W1493892051","https://openalex.org/W1502953220","https://openalex.org/W1548573590","https://openalex.org/W1562125942","https://openalex.org/W1593045043","https://openalex.org/W1772110815","https://openalex.org/W1894835849","https://openalex.org/W1965972569","https://openalex.org/W1977141583","https://openalex.org/W2018989507","https://openalex.org/W2044062612","https://openalex.org/W2053921957","https://openalex.org/W2058858139","https://openalex.org/W2069980026","https://openalex.org/W2080100102","https://openalex.org/W2080234606","https://openalex.org/W2082291422","https://openalex.org/W2103296194","https://openalex.org/W2109664771","https://openalex.org/W2112036337","https://openalex.org/W2112490010","https://openalex.org/W2122056984","https://openalex.org/W2122922578","https://openalex.org/W2127041269","https://openalex.org/W2132614334","https://openalex.org/W2147215264","https://openalex.org/W2159495802","https://openalex.org/W2160474561","https://openalex.org/W2168625136","https://openalex.org/W2170682101","https://openalex.org/W2171458318","https://openalex.org/W2177801600","https://openalex.org/W2250175843","https://openalex.org/W2882319491","https://openalex.org/W2979401726","https://openalex.org/W3133994440"],"related_works":["https://openalex.org/W1772110815","https://openalex.org/W2250175843","https://openalex.org/W2140960149","https://openalex.org/W2340044052","https://openalex.org/W36945892","https://openalex.org/W2044062612","https://openalex.org/W2399321432","https://openalex.org/W7096035052","https://openalex.org/W1554887429","https://openalex.org/W3128761492"],"abstract_inverted_index":{"We":[0,44],"exploit":[1],"sketch":[2,47],"techniques,":[3],"especially":[4],"the":[5,16,23,28,69],"Count-Min":[6,46],"sketch,":[7],"a":[8,19],"memory,":[9],"and":[10,53,82],"time":[11],"efficient":[12],"framework":[13],"which":[14],"approximates":[15],"frequency":[17],"of":[18,41,68,91,98],"word":[20,29,50,78],"pair":[21,30,51,79],"in":[22],"corpus":[24],"without":[25],"explicitly":[26],"storing":[27],"itself.":[31],"These":[32],"methods":[33],"use":[34],"hashing":[35],"to":[36,48,76,88],"deal":[37],"with":[38],"massive":[39],"amounts":[40],"streaming":[42],"text.":[43],"apply":[45],"approximate":[49],"counts":[52,80],"exhibit":[54],"their":[55],"effectiveness":[56],"on":[57,66],"three":[58,70],"important":[59],"NLP":[60],"tasks.":[61],"Our":[62,85],"experiments":[63],"demonstrate":[64],"that":[65],"all":[67],"tasks,":[71],"we":[72],"get":[73],"performance":[74],"comparable":[75],"Exact":[77],"setting":[81],"state-of-the-art":[83],"system.":[84],"method":[86],"scales":[87],"49":[89],"GB":[90,103],"unzipped":[92],"web":[93],"data":[94],"using":[95],"bounded":[96],"space":[97],"2":[99],"billion":[100],"counters":[101],"(8":[102],"memory).":[104],"1":[105]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}