{"id":"https://openalex.org/W4246264331","doi":"https://doi.org/10.3115/992383.992418","title":"Text disambiguation by finite state automata, an algorithm and experiments on corpora","display_name":"Text disambiguation by finite state automata, an algorithm and experiments on corpora","alternate_titles":[],"publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W4246264331","doi":"https://doi.org/10.3115/992383.992418"},"language":"en","primary_location":{"id":"doi:10.3115/992383.992418","doi":"https://doi.org/10.3115/992383.992418","is_oa":false,"landing_page_url":"https://doi.org/10.3115/992383.992418","pdf_url":null,"source":{"id":"https://openalex.org/S4306419219","display_name":"International Conference on Computational Linguistics","issn_l":"1525-2477","issn":["1525-2477"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th conference on Computational linguistics -","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W4246264331"],"child_works_count":0,"type":"conference-abstract","is_traditional":false,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048393875","display_name":"Emmanuel Roche","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Emmanuel Roche","raw_affiliation_strings":["Insitut Gaspard Monge CERIL-LADL, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Insitut Gaspard Monge CERIL-LADL, Paris, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5048393875"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"993","last_page":"993"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":9.999999747378752e-05,"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/T12353","display_name":"Lexicography and Language Studies","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1203","display_name":"Language and Linguistics"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/finite-state-machines","display_name":"finite automata","score":0.9390000104904175},{"id":"https://openalex.org/keywords/grammatical-constraints","display_name":"grammatical constraints","score":0.6349999904632568},{"id":"https://openalex.org/keywords/compound-nouns","display_name":"compound nouns","score":0.6000000238418579},{"id":"https://openalex.org/keywords/inflected-forms","display_name":"inflected forms","score":0.5659999847412109},{"id":"https://openalex.org/keywords/french-language","display_name":"French language","score":0.47200000286102295},{"id":"https://openalex.org/keywords/dictionary-indexing","display_name":"dictionary indexing","score":0.6209999918937683}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7017791271209717},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.5507614612579346},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5233139991760254},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.516925036907196},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.49127763509750366},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4519842863082886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36449676752090454},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.2314217984676361},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3115/992383.992418","doi":"https://doi.org/10.3115/992383.992418","is_oa":false,"landing_page_url":"https://doi.org/10.3115/992383.992418","pdf_url":null,"source":{"id":"https://openalex.org/S4306419219","display_name":"International Conference on Computational Linguistics","issn_l":"1525-2477","issn":["1525-2477"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th conference on Computational linguistics -","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7097202359","https://openalex.org/W7099903432","https://openalex.org/W7064130321","https://openalex.org/W1591828862","https://openalex.org/W1981933061","https://openalex.org/W1514495634","https://openalex.org/W758870310","https://openalex.org/W1587857291","https://openalex.org/W2271550520","https://openalex.org/W2480620222"],"abstract_inverted_index":{"Consulting":[0],"a":[1,7,50,95,206],"dictionary":[2,142,150,196],"for":[3,25,56],"the":[4,17,47,60,67,102,105,112,129,188,194,201],"words":[5,20],"of":[6,19,49,59,98,143,151,162,187,193,200],"given":[8],"text":[9,123],"provides":[10,205],"multiple":[11],"solutions,":[12],"that":[13,65,115],"is,":[14],"ambiguities;":[15],"thus,":[16],"sequence":[18],"pilot":[21],"studies":[22],"could":[23,43],"lead":[24],"example":[26],"to:pilot:":[27],"N":[28,34,39],"singular,":[29],"V":[30,32,36],"infinitive,":[31],"(conjugated)studies:":[33],"plural,":[35],"(conjugated)pilot":[37],"studies:":[38],"plural":[40],"(compound).These":[41],"informations":[42],"be":[44,178],"organized":[45],"in":[46,111,180],"form":[48],"finite":[51,80,117],"automaton":[52],"such":[53,165],"as:[see":[54],"pdf":[55],"figure]The":[57],"exploration":[58],"context":[61],"should":[62],"provide":[63],"clues":[64],"eliminate":[66],"non-relevant":[68],"solutions.":[69],"For":[70],"this":[71,91],"purpose":[72],"we":[73],"use":[74],"local":[75],"grammar":[76,202],"constraints":[77],"represented":[78,110,157],"by":[79,93,158,169],"automata.":[81,118],"We":[82],"have":[83],"designed":[84],"and":[85,104,125,148,198,208],"implemented":[86],"an":[87,170,185],"algorithm":[88],"which":[89],"performs":[90],"task":[92],"using":[94],"large":[96,138],"variety":[97],"linguistic":[99],"constraints.":[100,203],"Both":[101],"texts":[103,136],"rules":[106],"(or":[107],"constraints)":[108],"are":[109],"same":[113],"formalism,":[114],"is":[116,183],"Performing":[119],"subtraction":[120],"operations":[121],"between":[122],"automata":[124,127],"constraint":[126],"reduce":[128],"ambiguities.":[130],"Experiments":[131],"were":[132],"performed":[133],"on":[134],"French":[135],"with":[137],"scale":[139],"dictionaries":[140],"(one":[141],"600.000":[144],"simple":[145,207],"inflected":[146,153],"forms":[147],"one":[149],"150.000":[152],"compunds).":[154],"Syntactic":[155],"patterns":[156],"automata,":[159],"including":[160],"shapes":[161],"compound":[163],"nouns":[164],"as":[166],"Noun":[167],"followed":[168],"Adjective":[171],"(in":[172],"gender-number":[173],"agreement)":[174],"(Cf":[175],"5.1),":[176],"can":[177],"matched":[179],"texts.This":[181],"process":[182],"thus":[184],"extension":[186],"classic":[189],"matching":[190],"procedures":[191],"because":[192,199],"on-line":[195],"consultation":[197],"It":[204],"efficient":[209],"indexing":[210],"tool.":[211]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4246264331","counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2022-05-12T00:00:00"}
