Báo cáo khoa học: "Exploring Distributional Similarity Based Models for Query Spelling Correction" docx

... Table 2. Performance results for different models Table 2 details the performance scores for the experiments, which shows that both of the two distributional similarity- based models boost ... al., 1997). An investi- gation on distributional similarity functions can be found in (Lillian Lee, 1999). 3 Distributional Similarity- Based Mod- els for Query Spellin...

Ngày tải lên: 17/03/2014, 04:20

... experiments com- paring the similarity- based model for selectional preferences to Resnik’s WordNet -based model and to an EM -based clustering model 3 . For the similarity- based model we test the five ... band. Micro- averages, uniform weights of Resnik’s model are considerably higher than both the EM -based and the similarity- based models, which is unexpected. While EM -ba...

Ngày tải lên: 23/03/2014, 18:20

... prominent applications of distributional similarity, namely identifying lexical expansions. Lexical expansion looks for terms whose meaning implies that of a given target term, such as a query. It is widely employed ... lexical variability in ap- plications like Information Retrieval (IR), Infor- mation Extraction (IE) and Question Answering (QA). Often, distributional similarity me...

Ngày tải lên: 23/03/2014, 17:20

... the best accuracy/efficiency trade-off. 2 Distributional Similarity Measuring distributional similarity first requires the extraction of context information for each of the vocabulary terms from raw ... Curran (2005a; 2005b) found the performance of SASH for distributional similarity could be improved by replacing the initial random ordering with a frequency based ordering. In...

Ngày tải lên: 31/03/2014, 01:20

... that most often (125 cases/141 for rule [b], 50 cases/52 for rule [c]) the correct parsing isolates the second sub-group,noun2 adj for rule [b], noun2 prep noun3 for rule [c] (see the top left ... disambiguation rules for each of the ambiguous parsing rules. To work out the disambiguation rules, we adopted an empirical approach based on large-scale corpus experimentation....

Ngày tải lên: 09/03/2014, 01:20

Ngày tải lên: 09/03/2014, 01:20

... curve. Maximal F 1 on the curve is .43 for Exact-graph, .41 for TNF, and .34 for No-trans. AUC in the recall range 0-0.5 is .32 for Exact-graph, .31 for TNF, and .26 for No-trans. Run-time of LP-relax ... Max-Trans-Graph and Max-Trans-Forest (with an ILP solver) results in nearly identical performance. An ILP formulation for Max-Trans-Forest is sim- ple – a transitive graph is a...

Ngày tải lên: 16/03/2014, 19:20

... distinction here between formally syntax -based and linguistically syntax -based MT. A system like that of Yamada and Knight (2001) is both formally and linguistically syntax -based: for- mally because ... standing for X spanning f j i . We choose b and β to balance speed and performance on our development set. For our experiments, we set b = 40, β = 10 −1 for X cells, and b = 15, β...

Ngày tải lên: 17/03/2014, 05:20

... 1986). For a thorough discussion of transformation -based learning, see Ramshaw and Marcus (1996). Brill's work provides a proof of viability of transformation -based techniques in the form ... unsegmented language. 2 Transformation -based Segmentation The key component of our trainable segmenta- tion algorithm is Transformation -based Error-driven Learning, the corpus -b...

Ngày tải lên: 17/03/2014, 23:20

... HSpell wordlist (Har’el and Kenigsberg, 2004). 3 Morpheme -Based Model for Hebrew 3.1 Morpheme -Based HMM The lexical items of word -based models are the words of the language. The implication of ... rank analyses, based on the number of disambiguated occurrences in the text, normal- ized by the total number of occurrences for each word. Their application – indexing for an inform...

Ngày tải lên: 23/03/2014, 18:20