liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Computing Word Senses by Semantic Mirroring and Spectral Graph Partitioning
Linköping University, Department of Computer and Information Science, NLPLAB - Natural Language Processing Laboratory. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Scientific Computing. Linköping University, The Institute of Technology.ORCID iD: 0000-0003-2281-856X
Linköping University, Department of Computer and Information Science, NLPLAB - Natural Language Processing Laboratory. Linköping University, The Institute of Technology.
2010 (English)In: Proceedings of TextGraphs-5 - 2010 Workshop on Graph-based Methods for Natural Language Processing / [ed] Carmen Banea, Alessandro Moschitti, Swapna Somasundaran and Fabio Massimo Zanzotto, Stroudsburg, PA, USA: The Association for Computational Linguistics , 2010, 103-107 p.Conference paper, Published paper (Refereed)
Abstract [en]

Using the technique of ”semantic mirroring”a graph is obtained that representswords and their translations from a parallelcorpus or a bilingual lexicon. The connectednessof the graph holds informationabout the different meanings of words thatoccur in the translations. Spectral graphtheory is used to partition the graph, whichleads to a grouping of the words accordingto different senses. We also report resultsfrom an evaluation using a small sample ofseed words from a lexicon of Swedish andEnglish adjectives.

Place, publisher, year, edition, pages
Stroudsburg, PA, USA: The Association for Computational Linguistics , 2010. 103-107 p.
Keyword [en]
lexical relations, sense relations, graph theory, spectral graph partitioning
National Category
Language Technology (Computational Linguistics) Computer Science Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-59859ISBN: ISBN 978-1-932432-77-0 / 1-932432-77-9 (print)OAI: oai:DiVA.org:liu-59859DiVA: diva2:353683
Conference
48th Annual Meeting of the Association for Computational Linguistics
Projects
Multilingual term extraction and term structuring
Available from: 2010-09-28 Created: 2010-09-28 Last updated: 2013-08-30

Open Access in DiVA

No full text

Other links

http://www.aclweb.org/anthology/W/W10/W10-2317.pdf

Authority records BETA

Merkel, MagnusEldén, LarsAhrenberg, Lars

Search in DiVA

By author/editor
Merkel, MagnusEldén, LarsAhrenberg, Lars
By organisation
NLPLAB - Natural Language Processing LaboratoryThe Institute of TechnologyScientific Computing
Language Technology (Computational Linguistics)Computer ScienceComputational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 188 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf