@article{1541,
  author = {Mehreen Saba, Imran Sarwar Bajwa},
  title = {Quantifiers Types Resolution in NL Software Requirements},
  journal = {International Journal of Computational Linguistics Research},
  year = {2014},
  volume = {1},
  number = {1},
  doi = {},
  url = {http://www.dline.info/jcl/fulltext/v5n2/2.pdf},
  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.},
}