Distinguishing and classifying from \(n\)-ary properties

DOI10.1007/s00357-014-9151-1zbMath1360.68865OpenAlexW2076484922MaRDI QIDQ288890

Pascal Préa, Monique Rolbert

Publication date: 27 May 2016

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-014-9151-1

zbMATH Keywords

classificationdata analysiscomputational linguisticshierarchyultrametricgeneration of referring expressions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Natural language processing (68T50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
• Graph-Based Generation of Referring Expressions
• An Inferential Approach to the Generation of Referring Expressions
• Generating Referring Expressions: Boolean Extensions of the Incremental Algorithm
• Fuzzy sets
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs