{"id":"https://openalex.org/W1544570599","doi":null,"title":"Dependency tree matching with extended Tree edit distance with subtrees for textual entailment","display_name":"Dependency tree matching with extended Tree edit distance with subtrees for textual entailment","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1544570599","mag":"1544570599"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/5400d6f6-1caa-4203-aec1-25950a5c04d8","doi":null,"is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/5400d6f6-1caa-4203-aec1-25950a5c04d8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alabbas, M & Ramsay, A 2012, Dependency tree matching with extended Tree edit distance with subtrees for textual entailment. in 2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012|Fed. Conf. Comput. Sci. Inf. Syst., FedCSIS. Polish Information Processing Society, pp. 11-18, 2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012, Wroclaw, 1/07/12. < http://fedcsis.org/proceedings/fedcsis2012/pliks/222.pdf >","raw_type":"info:eu-repo/semantics/conferenceObject"},"volume":null,"type":"conference-paper","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":"https://openalex.org/A5002154374","display_name":"Maytham Alabbas","orcid":"https://orcid.org/0000-0001-8548-5075","observed_orcids":["https://orcid.org/0000-0001-8548-5075"]},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Maytham Alabbas","raw_affiliation_strings":["School of Computer Science, University of Manchester,Manchester M13 9PL,UK"],"raw_orcid":"https://orcid.org/0000-0001-8548-5075","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Manchester,Manchester M13 9PL,UK","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035477242","display_name":"Allan Ramsay","orcid":"https://orcid.org/0000-0002-9903-0722","observed_orcids":["https://orcid.org/0000-0002-9903-0722"]},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Allan Ramsay","raw_affiliation_strings":["School of Computer Science, University of Manchester,Manchester M13 9PL,UK"],"raw_orcid":"https://orcid.org/0000-0002-9903-0722","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Manchester,Manchester M13 9PL,UK","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I28407311"],"apc_list":null,"apc_paid":null,"fwci":0.2596,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.36141494,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.989300012588501,"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.989300012588501,"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.003000000026077032,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.002899999963119626,"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/tree-edit-distance","display_name":"tree edit distance","score":0.949999988079071},{"id":"https://openalex.org/keywords/dependency-trees","display_name":"dependency trees","score":0.7459999918937683},{"id":"https://openalex.org/keywords/natural-language-inference","display_name":"natural language inference","score":0.9470000267028809}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8099253177642822},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6330166459083557},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.6013398170471191},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5856465101242065},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.581506609916687},{"id":"https://openalex.org/C95318506","wikidata":"https://www.wikidata.org/wiki/Q6588467","display_name":"Textual entailment","level":3,"score":0.5547656416893005},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5396419167518616},{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.5138171315193176},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49756839871406555},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.47236138582229614},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.4677906930446625},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4559183716773987},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.412243127822876},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38626956939697266},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2904355525970459},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13227981328964233},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.11722901463508606},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09960746765136719},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/5400d6f6-1caa-4203-aec1-25950a5c04d8","doi":null,"is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/5400d6f6-1caa-4203-aec1-25950a5c04d8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alabbas, M & Ramsay, A 2012, Dependency tree matching with extended Tree edit distance with subtrees for textual entailment. in 2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012|Fed. Conf. Comput. Sci. Inf. Syst., FedCSIS. Polish Information Processing Society, pp. 11-18, 2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012, Wroclaw, 1/07/12. < http://fedcsis.org/proceedings/fedcsis2012/pliks/222.pdf >","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:3148459519","doi":null,"is_oa":false,"landing_page_url":"http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006354368","pdf_url":null,"source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":false,"is_in_doaj":true,"is_core":false,"listed_in":["ddh","doaj","jufo-1","norway-1","oarl"],"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Federated Conference on Computer Science and Information Systems","raw_type":null},{"id":"mag:1544570599","doi":null,"is_oa":false,"landing_page_url":"https://fedcsis.org/proceedings/2012/pliks/222.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":false,"is_in_doaj":true,"is_core":false,"listed_in":["ddh","doaj","jufo-1","norway-1","oarl"],"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Federated Conference on Computer Science and Information Systems","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W137514618","https://openalex.org/W201141796","https://openalex.org/W1514986335","https://openalex.org/W1517346485","https://openalex.org/W1568793342","https://openalex.org/W1975009259","https://openalex.org/W1976373002","https://openalex.org/W1978478796","https://openalex.org/W1988714735","https://openalex.org/W1988996877","https://openalex.org/W2039087642","https://openalex.org/W2048001624","https://openalex.org/W2114659403","https://openalex.org/W2116702211","https://openalex.org/W2126458564","https://openalex.org/W2143541936","https://openalex.org/W2188968417","https://openalex.org/W2252004494","https://openalex.org/W2586606279","https://openalex.org/W2820473366"],"related_works":["https://openalex.org/W2250227320","https://openalex.org/W2482598837","https://openalex.org/W2113078760","https://openalex.org/W1616853180","https://openalex.org/W1934563744","https://openalex.org/W1541106661","https://openalex.org/W7095225397","https://openalex.org/W2357496157","https://openalex.org/W1559350420","https://openalex.org/W2181780175"],"abstract_inverted_index":{"A":[0],"lot":[1],"of":[2,11,15,32,105,113,131],"natural":[3],"language":[4],"processing":[5],"(NLP)":[6],"applications":[7,83],"require":[8],"the":[9,33,67,78,103,123],"computation":[10],"similarities":[12],"between":[13],"pairs":[14],"syntactic":[16],"or":[17],"semantic":[18],"trees.":[19,133],"Tree":[20],"edit":[21],"distance":[22],"(TED),":[23],"in":[24,92],"this":[25],"context,":[26],"is":[27,41],"considered":[28],"to":[29,54,87],"be":[30,100],"one":[31,125],"most":[34],"effective":[35,74],"techniques.":[36],"However,":[37],"its":[38,107],"main":[39],"drawback":[40],"that":[42,84],"it":[43],"deals":[44],"with":[45,56,70,116,122],"single":[46,63],"node":[47],"operations":[48,59,72,118],"only.":[49],"We":[50],"therefore":[51],"extended":[52,68,114],"TED":[53,69,115],"deal":[55],"subtree":[57,71,98,117],"transformation":[58],"as":[60,62],"well":[61],"nodes.":[64],"This":[65],"makes":[66],"more":[73],"and":[75],"flexible":[76],"than":[77,102],"standard":[79,124],"TED,":[80],"especially":[81],"for":[82],"pay":[85],"attention":[86],"relations":[88],"among":[89],"nodes":[90],"(e.g.":[91],"linguistic":[93],"trees,":[94],"deleting":[95,106],"a":[96],"modifier":[97],"should":[99],"cheaper":[101],"sum":[104],"components":[108],"individually).":[109],"The":[110],"preliminary":[111],"results":[112],"were":[119],"encouraging":[120],"compared":[121],"when":[126],"tested":[127],"on":[128],"different":[129],"examples":[130],"dependency":[132],"\u00a9":[134],"2012":[135],"Polish":[136],"Info":[137],"Processing":[138],"Socit.":[139]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-10-31T12:09:11.096373","created_date":"2016-06-24T00:00:00"}