{"id":"https://openalex.org/W2048216502","doi":"https://doi.org/10.1017/s1351324911000076","title":"Using regular tree grammars to enhance sentence realisation","display_name":"Using regular tree grammars to enhance sentence realisation","publication_year":2011,"publication_date":"2011-03-21","ids":{"openalex":"https://openalex.org/W2048216502","doi":"https://doi.org/10.1017/s1351324911000076","mag":"2048216502"},"language":"en","primary_location":{"id":"doi:10.1017/s1351324911000076","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1351324911000076","pdf_url":null,"source":{"id":"https://openalex.org/S18088403","display_name":"Natural Language Engineering","issn_l":"1351-3249","issn":["1351-3249","1469-8110"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Language Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00537219","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087459652","display_name":"Claire Gardent","orcid":"https://orcid.org/0000-0002-3805-6662"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I4210127166","display_name":"Centre Inria de l'Universit\u00e9 de Lorraine","ror":"https://ror.org/03fcjvn64","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210127166"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"CLAIRE GARDENT","raw_affiliation_strings":["CNRS/LORIA, 615 Rue du jardin botanique, 54600 Villers-l\u00e8s-Nancy, France","Cnrs/loria, 615 rue du jardin botanique, 54600 villers-l??s-nancy, france email: claire.gardent@loria.fr#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS/LORIA, 615 Rue du jardin botanique, 54600 Villers-l\u00e8s-Nancy, France","institution_ids":["https://openalex.org/I4210127166","https://openalex.org/I4210121838","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Cnrs/loria, 615 rue du jardin botanique, 54600 villers-l??s-nancy, france email: claire.gardent@loria.fr#TAB#","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210121838"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081945431","display_name":"Benjamin Gottesman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"BENJAMIN GOTTESMAN","raw_affiliation_strings":["acrolinx GmbH, Rosenstra\u00dfe 2, 10178 Berlin, Germany","Acrolinx gmbh, rosenstra??e 2, 10178 berlin, germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"acrolinx GmbH, Rosenstra\u00dfe 2, 10178 Berlin, Germany","institution_ids":[]},{"raw_affiliation_string":"Acrolinx gmbh, rosenstra??e 2, 10178 berlin, germany#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005336295","display_name":"Laura Perez-Beltrachini","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I4210127166","display_name":"Centre Inria de l'Universit\u00e9 de Lorraine","ror":"https://ror.org/03fcjvn64","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210127166"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"LAURA PEREZ-BELTRACHINI","raw_affiliation_strings":["Nancy 1/LORIA, 615 Rue du jardin botanique, 54600 Villers-l\u00e8s-Nancy, France","Nancy 1/loria, 615 rue du jardin botanique, 54600 villers-l??s-nancy, france#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nancy 1/LORIA, 615 Rue du jardin botanique, 54600 Villers-l\u00e8s-Nancy, France","institution_ids":["https://openalex.org/I4210127166","https://openalex.org/I4210121838"]},{"raw_affiliation_string":"Nancy 1/loria, 615 rue du jardin botanique, 54600 villers-l??s-nancy, france#TAB#","institution_ids":["https://openalex.org/I4210127166","https://openalex.org/I4210121838"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7586,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.86931184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"17","issue":"2","first_page":"185","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9998999834060669,"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.9998999834060669,"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":0.9952999949455261,"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/T11567","display_name":"semigroups and automata theory","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.8778564929962158},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6815841794013977},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6756686568260193},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.6701646447181702},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.6089708805084229},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6050283312797546},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.5871975421905518},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5396201014518738},{"id":"https://openalex.org/keywords/sentence","display_name":"Sentence","score":0.5392934083938599},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.5390471816062927},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.5373107194900513},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.5221222639083862},{"id":"https://openalex.org/keywords/regular-tree-grammar","display_name":"Regular tree grammar","score":0.47523096203804016},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.46365082263946533},{"id":"https://openalex.org/keywords/realisation","display_name":"Realisation","score":0.4188838005065918},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32495445013046265},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.22394588589668274},{"id":"https://openalex.org/keywords/mildly-context-sensitive-grammar-formalism","display_name":"Mildly context-sensitive grammar formalism","score":0.11193573474884033},{"id":"https://openalex.org/keywords/generative-grammar","display_name":"Generative grammar","score":0.09836134314537048},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.092501699924469},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07193419337272644},{"id":"https://openalex.org/keywords/phrase-structure-rules","display_name":"Phrase structure rules","score":0.06418824195861816}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8778564929962158},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6815841794013977},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6756686568260193},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.6701646447181702},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.6089708805084229},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6050283312797546},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.5871975421905518},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5396201014518738},{"id":"https://openalex.org/C2777530160","wikidata":"https://www.wikidata.org/wiki/Q41796","display_name":"Sentence","level":2,"score":0.5392934083938599},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.5390471816062927},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.5373107194900513},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.5221222639083862},{"id":"https://openalex.org/C57097763","wikidata":"https://www.wikidata.org/wiki/Q7309622","display_name":"Regular tree grammar","level":5,"score":0.47523096203804016},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46365082263946533},{"id":"https://openalex.org/C2779462738","wikidata":"https://www.wikidata.org/wiki/Q17146409","display_name":"Realisation","level":2,"score":0.4188838005065918},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32495445013046265},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.22394588589668274},{"id":"https://openalex.org/C172265290","wikidata":"https://www.wikidata.org/wiki/Q6134957","display_name":"Mildly context-sensitive grammar formalism","level":4,"score":0.11193573474884033},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.09836134314537048},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.092501699924469},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07193419337272644},{"id":"https://openalex.org/C80877019","wikidata":"https://www.wikidata.org/wiki/Q7188074","display_name":"Phrase structure rules","level":3,"score":0.06418824195861816},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1351324911000076","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1351324911000076","pdf_url":null,"source":{"id":"https://openalex.org/S18088403","display_name":"Natural Language Engineering","issn_l":"1351-3249","issn":["1351-3249","1469-8110"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Language Engineering","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.230.1505","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.230.1505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/docs/00/53/72/19/PDF/nle-final.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00537219v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00537219","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Natural Language Engineering, 2011, Finite State Methods and Models in Natural Language Processing, 17 (2), pp.185-201. ⟨10.1017/S1351324911000076⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00537219v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00537219","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Natural Language Engineering, 2011, Finite State Methods and Models in Natural Language Processing, 17 (2), pp.185-201. ⟨10.1017/S1351324911000076⟩","raw_type":"Journal articles"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W128638292","https://openalex.org/W160354491","https://openalex.org/W191937437","https://openalex.org/W1479758177","https://openalex.org/W1498990157","https://openalex.org/W1584587517","https://openalex.org/W1593271688","https://openalex.org/W1649160680","https://openalex.org/W1914208668","https://openalex.org/W1966705350","https://openalex.org/W1983878972","https://openalex.org/W2020552488","https://openalex.org/W2068213446","https://openalex.org/W2100211259","https://openalex.org/W2111397047","https://openalex.org/W2121924470","https://openalex.org/W2144098329","https://openalex.org/W2147138267","https://openalex.org/W2161856400","https://openalex.org/W2264878610","https://openalex.org/W2498564848","https://openalex.org/W2606362122","https://openalex.org/W2610593052","https://openalex.org/W2746237683","https://openalex.org/W2892737606","https://openalex.org/W4234352621","https://openalex.org/W4243412374","https://openalex.org/W6635485671","https://openalex.org/W6676351387"],"related_works":["https://openalex.org/W2167662847","https://openalex.org/W4502575","https://openalex.org/W1998962249","https://openalex.org/W3013856176","https://openalex.org/W1537895043","https://openalex.org/W2572467330","https://openalex.org/W1988308209","https://openalex.org/W1575672172","https://openalex.org/W2250603603","https://openalex.org/W160354491"],"abstract_inverted_index":{"Abstract":[0],"Feature-based":[1],"regular":[2],"tree":[3,17],"grammars":[4],"(FRTG)":[5],"can":[6,74],"be":[7,75],"used":[8],"to":[9,27,52],"generate":[10],"the":[11,47,70],"derivation":[12,63],"trees":[13,64],"of":[14,24,61],"a":[15,37,59,89],"feature-based":[16,78],"adjoining":[18],"grammar":[19,60],"(FTAG).":[20],"We":[21,43],"make":[22],"use":[23],"this":[25,41],"fact":[26],"specify":[28],"and":[29,36,83,86,96],"implement":[30],"both":[31],"an":[32],"FTAG-based":[33],"sentence":[34],"realiser":[35],"benchmark":[38,94],"generator":[39],"for":[40,92],"realiser.":[42],"argue":[44],"furthermore":[45],"that":[46,73],"FRTG":[48],"encoding":[49],"enables":[50],"us":[51],"improve":[53],"on":[54,58],"other":[55],"proposals":[56],"based":[57],"TAG":[62],"in":[65,77],"several":[66],"ways.":[67],"It":[68],"preserves":[69],"compositional":[71],"semantics":[72],"encoded":[76],"TAGs;":[79],"it":[80,87],"increases":[81],"efficiency":[82],"restricts":[84],"overgeneration;":[85],"provides":[88],"uniform":[90],"resource":[91],"generation,":[93],"construction":[95],"parsing.":[97]},"counts_by_year":[{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}