Sciweavers

24 search results - page 1 / 5
» Automatic detection and resolution of lexical ambiguity in p...
Sort
View
ACL
1992
13 years 6 months ago
GPSM: A Generalized Probabilistic Semantic Model for Ambiguity Resolution
In natural language processing, ambiguity resolution is a central issue, and can be regarded as a preference assignment problem. In this paper, a Generalized Probabilistic Semanti...
Jing-Shin Chang, Yih-Fen Luo, Keh-Yih Su
ACIIDS
2010
IEEE
172views Database» more  ACIIDS 2010»
13 years 10 months ago
Automatic Lexical Annotation Applied to the SCARLET Ontology Matcher
This paper proposes lexical annotation as an effective method to solve the ambiguity problems that affect ontology matchers. Lexical annotation associates to each ontology elemen...
Laura Po, Sonia Bergamaschi
ACL
2006
13 years 6 months ago
Multi-Tagging for Lexicalized-Grammar Parsing
With performance above 97% accuracy for newspaper text, part of speech (POS) tagging might be considered a solved problem. Previous studies have shown that allowing the parser to ...
James R. Curran, Stephen Clark, David Vadas
ICMI
2005
Springer
136views Biometrics» more  ICMI 2005»
13 years 10 months ago
Probabilistic grounding of situated speech using plan recognition and reference resolution
Situated, spontaneous speech may be ambiguous along acoustic, lexical, grammatical and semantic dimensions. To understand such a seemingly difficult signal, we propose to model th...
Peter Gorniak, Deb Roy
COLING
2008
13 years 6 months ago
A Fully-Lexicalized Probabilistic Model for Japanese Zero Anaphora Resolution
This paper presents a probabilistic model for Japanese zero anaphora resolution. First, this model recognizes discourse entities and links all mentions to them. Zero pronouns are ...
Ryohei Sasano, Daisuke Kawahara, Sadao Kurohashi