Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
ERROR-TOLERANT RETRIEVAL OF TREES
Autore:
OFLAZER K;
Indirizzi:
BILKENT UNIV,DEPT COMP SCI & INFORMAT ENGN BILKENT ANKARA TURKEY
Titolo Testata:
IEEE transactions on pattern analysis and machine intelligence
fascicolo: 12, volume: 19, anno: 1997,
pagine: 1376 - 1380
SICI:
0162-8828(1997)19:12<1376:EROT>2.0.ZU;2-J
Fonte:
ISI
Lingua:
ENG
Soggetto:
SPELLING CORRECTION;
Keywords:
EXAMPLE-BASED MACHINE TRANSLATION; APPROXIMATE TREE COMPARISON; RETRIEVAL FROM LEXICAL DATABASES; TREE DATABASES;
Tipo documento:
Article
Natura:
Periodico
Citazioni:
11
Recensione:
Indirizzi per estratti:
Citazione:
K. Oflazer, "ERROR-TOLERANT RETRIEVAL OF TREES", IEEE transactions on pattern analysis and machine intelligence, 19(12), 1997, pp. 1376-1380

Abstract

We present an efficient algorithm for retrieving from a database of trees, all trees that differ from a given query tree by a small number additional or missing leaves, or leaf label changes. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. For large randomly generated synthetic tree databases (some having tens of thousands of trees), andon databases constructed from Wall Street Journal treebank, it can retrieve for trees with a small error, in a matter of tenths of a secondto about a second.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 04/04/20 alle ore 08:25:59