DocumentCode :
2929344
Title :
Quantifiers Types Resolution in NL Software Requirements
Author :
Saba, Mehreen ; Bajwa, Imran Sarwar
Author_Institution :
Dept. of Comput. Sci., Islamia Univ. of Bahawalpur, Bahawalpur, Pakistan
fYear :
2013
fDate :
24-30 Nov. 2013
Firstpage :
228
Lastpage :
233
Abstract :
Natural language quantifiers can be classified according to their semantic type in addition to their syntactic expression. Quantification in Natural language (NL) has two types, ambiguous quantification and Unambiguous quantification. Unambiguous quantification is very simple and also called exact quantification, but ambiguous quantification is complex and also called inexact quantification. Inexact quantifiers include "many, much, a lot of, several, some, any, a few, little, fewer, fewest, Less, greater, at least, at most, more, exactly". To identify the problems of Natural language Quantification, convert these Natural Language sentences into First order logic by attaching weights and classify these complex sentences by using Markov Logic.
Keywords :
Markov processes; formal logic; formal specification; natural language processing; Markov logic; NL software requirements; ambiguous quantification; complex sentence classification; first order logic; natural language quantification; natural language quantifier classification; natural language sentences; quantifier type resolution; syntactic expression; Joining processes; Markov random fields; Natural languages; Pragmatics; Semantics; Syntactics; Markov Logic; NL Quantifiers; Quantifier Type Resolution;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Artificial Intelligence (MICAI), 2013 12th Mexican International Conference on
Conference_Location :
Mexico City
Print_ISBN :
978-1-4799-2604-6
Type :
conf
DOI :
10.1109/MICAI.2013.49
Filename :
6714673
Link To Document :
بازگشت