Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 48
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

First-order vs. higher-order modification in distributional semantics

  • Boleda, Gemma
  • Vecchi, Eva Maria
  • Cornudella Gaya, Miquel
  • McNally, Louise, 1965-
Comunicació presentada a Empirical Methods in Natural Language Processing and Computational Natural Language Learning, celebrada del 12 al 14 de juliol de 2012, a Jeju Island, Korea., Adjectival modification, particularly by expressions that have been treated as higher-order modifiers in the formal semantics tradition, raises interesting challenges for semantic composition in distributional semantic models. We contrast three types of adjectival modifiers -- intersectively used color terms (as in white towel, clearly first-order), subsectively used color terms (white wine, which have been modeled as both first- and higher-order), and intensional adjectives (former bassist, clearly higher-order) -- and test the ability of different composition strategies to model their behavior. In addition to opening up a new empirical domain for research on distributional semantics, our observations concerning the attested vectors for the different types of adjectives, the nouns they modify, and the resulting noun phrases yield insights into modification that have been little evident in the formal semantics literature to date., This research was funded by the Spanish MICINN (FFI2010-09464-E, FFI2010-15006, TIN2009-14715-C04-04), the Catalan AGAUR (2010BPA00070), and the EU (PASCAL2; FP7-ICT-216886). Eva Maria Vecchi was partially funded by ERC Starting Grant 283554.
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Adjectives as saturators vs. modifiers: statistical evidence

  • McNally, Louise, 1965-
  • Boleda, Gemma
  • Evert, Stefan
  • Gehrke, Berit
This paper reports on a large-scale, statistical analysis of corpus data to support the null hypothesis that ethnic adjectives (EAs, e.g. French) are ordinary adjectives, rather than argument-saturating \nouns in disguise" (in, e.g., French agreement). In particular, EAs are argued to simply modify the noun they combine with; their special properties in inducing argument-like behavior arises from the interaction between the semantics of event nominals and that of the adjective., This work was supported by grants from the Spanish Ministry of Science and Innovation (FFI2010-15006, TIN2009-14715-C04-04 (KNOW-II), JCI-2010-08581), as well as by the European Union via the EU PASCAL2 Network of Excellence (FP7-ICT-216886) and by the Fundació ICREA.
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Intensionality was only alleged: on adjective-noun composition in distributional semantics

  • Boleda, Gemma
  • Baroni, Marco
  • Pham, Nghia The
  • McNally, Louise, 1965-
Distributional semantics has very successfully modeled semantic phenomena at the word level, and recently interest has grown in extending it to capture the meaning of phrases via semantic composition. We present experiments in adjective-noun composition which (1) show that adjectival modification can be successfully modeled with distributional semantics, (2) show that composition models inspired by the semantics of higher-order predication fare better than those that perform simple feature union or intersection, (3) contrary to what the theoretical literature might lead one to expect, do not yield a distinction between intensional and non-intensional modification, and (4) suggest that head noun polysemy and whether the adjective corresponds to a typical attribute of the noun are relevant factors in the distributional representation of adjective phrases., We acknowledge the support of Spanish MICINN grant FFI2010-09464-E (McNally, Boleda), the ICREA Foundation (McNally), Catalan AGAUR grant 2010BP-A00070, MICINN grant TIN2009-14715-C04-04, EU grant PASCAL2, FP7-ICT-216886, the DARPA DEFT program under AFRL grant FA8750-13-2-0026 (Boleda) and the ERC under the 2011 Starting Independent Research Grant 283554 to the COMPOSES project (Baroni, Pham). Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the view of DARPA, AFRL or the US government.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Discriminative Bernoulli HMMs for isolated handwritten word recognition

  • Giménez Pastor, Adrián
  • Andrés Ferrer, Jesús
  • Juan, Alfons
[EN] Bernoulli HMMs (BHMMs) have been successfully applied to handwritten text recognition (HTR) tasks such as continuous and isolated handwritten words. BHMMs belong to the generative model family and, hence, are usually trained by (joint) maximum likelihood estimation (MLE) by means of the Baum-Welch algorithm. Despite the good properties of the MLE criterion, there are better training criteria such as maximum mutual information (MM!). The MMI is the most widespread criterion to train discriminative models such as log-linear (or maximum entropy) models. Inspired by a BHMM classifier, in this work, a log-linear HMM (LLHMM) for binary data is proposed. The proposed model is proved to be equivalent to the BHMM classifier, and, in this way, a discriminative training framework for BHMM classifiers is defined. The behavior of the proposed discriminative training framework is deeply studied in a well known task of isolated word recognition, the RIMES database. (C) 2013 Elsevier B.V. All rights reserved., Work supported by the EC (FEDER/FSE) and the Spanish MEC/MICINN under the MIPRCV ‘‘Consolider Ingenio 2010’’ program (CSD2007-00018), iTrans2 (TIN2009-14511) and MITTRAL (TIN2009-14633-C03-01) projects. Also supported by the IST Programme of the European Community, under the PASCAL2 Network of Excellence, IST-2007-216886, and by the Spanish MITyC under the erudito.com (TSI-020110-2009-439).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Capítulo o parte de un libro (BookPart)

Discriminative Bernoulli Mixture Models for Handwritten Digit Recognition

  • Giménez Pastor, Adrián
  • Juan, Alfons|||0000-0002-9984-4072
  • Andrés Ferrer, Jesús
  • Serrano Martinez Santos, Nicolas
Bernoulli-based models such as Bernoulli mixtures or Bernoulli HMMs (BHMMs), have been successfully applied to several handwritten text recognition (HTR) tasks which range from character recognition to continuous and isolated handwritten words. All these models belong to the generative model family and, hence, are usually trained by (joint) maximum likelihood estimation (MLE). Despite the good properties of the MLE criterion, there are better training criteria such as maximum mutual information (MMI). The MMI is a widespread criterion that is mainly employed to train discriminative models such as log-linear (or maximum entropy) models. Inspired by the Bernoulli mixture classifier, in this work a log-linear model for binary data is proposed, the so-called mixture of multiclass logistic regression. The proposed model is proved to be equivalent to the Bernoulli mixture classifier. In this way, we give a discriminative training framework for Bernoulli mixture models. The proposed discriminative training framework is applied to a well-known Indian digit recognition task., Work supported by the EC (FEDER/FSE) and the Spanish MEC/MICINN under the MIPRCV “Consolider Ingenio 2010” program (CSD2007-00018), iTrans2 (TIN2009-14511) and MITTRAL (TIN2009-14633-C03-01) projects. Also supported by the IST Programme of the European Community, under the PASCAL2 Network of Excellence, IST-2007-216886, and by the Spanish MITyC under the erudito.com (TSI-020110-2009-439).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Capítulo o parte de un libro (BookPart)

Interactive structured output prediction: Application to chromosome classification

  • Oncina Carratalá, José
  • Vidal, Enrique|||0000-0003-4579-5196
Interactive Pattern Recognition concepts and techniques are applied to problems with structured output; i.e., problems in which the result is not just a simple class label, but a suitable structure of labels. For illustration purposes (a simplification of) the problem of Human Karyotyping is considered. Results show that a) taking into account label dependencies in a karyogram significantly reduces the classical (non-interactive) chromosome label prediction error rate and b) they are further improved when interactive processing is adopted. c Springer-Verlag Berlin Heidelberg 2011, Work supported by the MIPRCV Spanish MICINN “Consolider Ingenio 2010” program (CSD2007-00018). Work supported by the Spanish CICyT through project TIN2009-14205-C04-01. This work was supported in part by the IST Programme of the European Community, under the PASCAL2 Network of Excellence, IST-2007- 216886.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Tree structured and combined methods for comparing metered polyphonic music

  • Rizo, David
  • Lemström, Kjell
  • Iñesta, José M.
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
Identifying copies or different versions of a same musical work is a focal problem in maintaining large music databases. In this paper we introduce novel ideas and methods that are applicable to metered, symbolically encoded polyphonic music. We show how to represent and compare polyphonic music using a tree structure. Moreover, we put for trial various comparison methods and observe whether better comparison results can be obtained by combining distinct similarity measures. Our experiments show that the proposed representation is adequate for the task with good quality results and processing times, and when combined with other methods it becomes more robust against various types of music.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Multiple fundamental frequency estimation using Gaussian smoothness and short context

  • Pertusa, Antonio
  • Iñesta, José M.
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Pertusa, Antonio|||/items/3bf633ff-4d49-4aaa-a004-abcf6fed3540
A multiple fundamental frequency estimator is presented in this work. At each time frame, a set of fundamental frequencies is found in a frame by frame analysis taking into account the spectral smoothness measure described in (Pertusa & Iñesta, ICASSP 2008) and the information contained in adjacent frames.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Impact of the initialization in tree-based fast similarity search techniques

  • Serrano Díaz-Carrasco, Aureo
  • Micó, Luisa
  • Oncina, Jose
Many fast similarity search techniques relies on the use of pivots (specially selected points in the data set). Using these points, specific structures (indexes) are built speeding up the search when queering. Usually, pivot selection techniques are incremental, being the first one randomly chosen. This article explores several techniques to choose the first pivot in a tree-based fast similarity search technique. We provide experimental results showing that an adequate choice of this pivot leads to significant reductions in distance computations and time complexity. Moreover, most pivot tree-based indexes emphasizes in building balanced trees. We provide experimentally and theoretical support that very unbalanced trees can be a better choice than balanced ones.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Use of structured pattern representations for combining classifiers

  • Socorro Llanes, Raisa
  • Micó, Luisa
In Pattern Recognition, there are problems where distinct representations can be obtained for the same pattern, and depending on the type of classifiers (statistical or structural) one type of representation is preferred versus the others. In the last years, different approaches to combining classifiers have been proposed to improve the performance of individual classifiers. However, few works investigated the use of structured pattern representations. In this paper combination of classifiers has been applied using tree pattern representation in combination with strings and vectors for a handwritten character classification task. In order to save computational cost, some proposals based on the use of both embedding structured data and refine and filter framework are provided.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Metamidi: a tool for automatic metadata extraction from MIDI files

  • Pérez García, Tomás
  • Iñesta, José M.
  • Rizo, David
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
The increasing availability of on-line music has motivated a growing interest for organizing, commercializing, and delivering this kind of multimedia content. For it, the use of metadata is of utmost importance. Metadata permit organization, indexing, and retrieval of music contents. They are, therefore, a subject of research both from the design and automatic extraction approaches. The present work focuses on this second issue, providing an open source tool for metadata extraction from standard MIDI files. The tool is presented, the utilized metadata are explained, and some applications and experiments are described as examples of its capabilities.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A distance for partially labeled trees

  • Calvo-Zaragoza, Jorge
  • Rizo, David
  • Iñesta, José M.
  • Calvo-Zaragoza, Jorge|||/items/a4f3686d-f0fe-4317-a73c-cd711ceb1dde
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
In a number of practical situations, data have structure and the relations among its component parts need to be coded with suitable data models. Trees are usually utilized for representing data for which hierarchical relations can be defined. This is the case in a number of fields like image analysis, natural language processing, protein structure, or music retrieval, to name a few. In those cases, procedures for comparing trees are very relevant. An approximate tree edit distance algorithm has been introduced for working with trees labeled only at the leaves. In this paper, it has been applied to handwritten character recognition, providing accuracies comparable to those by the most comprehensive search method, being as efficient as the fastest.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Using multiplicity automata to identify transducer relations from membership and equivalence queries

  • Oncina, Jose
Multiplicity Automata are devices that implement functions from a string space to a field. Usually the real number’s field is used. From a learning point of view there exists some algorithms that are able to identify any multiplicity automaton from membership and equivalence queries. In this work we realize that those algorithms can also be used if the algebraic structure of a field is relaxed to a divisive ring structure, that is, the commutativity of the product operation is dropped. Moreover, we define an algebraic structure, which is an extension of the string monoid, that allows the identification of any transduction that can be realized by finite state machines without empty-transitions.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Mining digital music score collections: melody extraction and genre recognition

  • Ponce de León Amador, Pedro José
  • Iñesta, José M.
  • Rizo, David
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Ponce de León Amador, Pedro José|||/items/9301f92f-611c-4636-a5c2-89fcfbe35694
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
In the field of computer music, pattern recognition algorithms are very relevant for music information retrieval (MIR) applications. Two challenging tasks in this area is the automatic recognition of musical genre and melody extraction, having a number of applications like indexing and selecting musical databases. One of the main references for music is its melody. In a practical environment of digital music score collections the information can be found in standard MIDI file format. Music is structured as a number of tracks in this file format, usually one of them containing the melodic line, while others tracks contain the accompaniment. Finding that melody track is very useful for a number of applications, like speeding up melody matching when searching in MIDI databases, extracting motifs for musicological analysis, building music thumbnails or extracting melodic ringtones from MIDI files. In the first part of this chapter, musical content information is modeled by computing global statistical descriptors from track content. These descriptors are the input to a random forest classifier that assigns the probability of being a melodic line to each track. The track with the highest probability is then selected as the one containing the melodic line of the MIDI file. The first part of this chapter ends with a discussion on results obtained from a number of databases of different music styles. The second part of the chapter deals with the problem of classifying such melodies in a collection of music genres. A slightly different approach is used for this task, first dividing a melody track in segments of fixed length. Statistical features are extracted for each segment and used to classify them as one of several genres. The proposed methodology is presented, covering the feature extraction, feature selection, and genre classification stages. Different supervised classification methods, like Bayesian classifier and nearest neighbors are applied. As a proof of concept, the performance of such algorithms against different description models and parameters is analyzed for two particular musical genres, like jazz and classical music.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Characterization of contour regularities based on the Levenshtein edit distance

  • Abreu Salas, José Ignacio
  • Rico-Juan, Juan Ramón
  • Abreu Salas, José Ignacio|||/items/99fd9ec6-0b97-4c02-a28e-98bc309cff48
  • Rico-Juan, Juan Ramón|||/items/ab906fc8-ea97-4172-a38d-6eb429e9dc84
This paper describes a new method for quantifying the regularity of contours and comparing them (when encoded by Freeman chain codes) in terms of a similarity criterion which relies on information gathered from Levenshtein edit distance computation. The criterion used allows subsequences to be found from the minimal cost edit sequence that specifies an alignment of contour segments which are similar. Two external parameters adjust the similarity criterion. The information about each similar part is encoded by strings that represent an average contour region. An explanation of how to construct a prototype based on the identified regularities is also reviewed. The reliability of the prototypes is evaluated by replacing contour groups (samples) by new prototypes used as the training set in a classification task. This way, the size of the data set can be reduced without sensibly affecting its representational power for classification purposes. Experimental results show that this scheme achieves a reduction in the size of the training data set of about 80% while the classification error only increases by 0.45% in one of the three data sets studied.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

SEDiL: Software for Edit Distance Learning

  • Boyer, Laurent
  • Esposito, Yann
  • Habrard, Amaury
  • Oncina, Jose
  • Sebban, Marc
In this paper, we present SEDiL, a Software for Edit Distance Learning. SEDiL is an innovative prototype implementation grouping together most of the state of the art methods that aim to automatically learn the parameters of string and tree edit distances.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Genre classification using chords and stochastic language models

  • Pérez-Sancho, Carlos
  • Rizo, David
  • Iñesta, José M.
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Pérez-Sancho, Carlos|||/items/d0da1799-8c21-428f-bca1-e322b025fe2f
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
Music genre meta-data is of paramount importance for the organisation of music repositories. People use genre in a natural way when entering a music store or looking into music collections. Automatic genre classification has become a popular topic in music information retrieval research both, with digital audio and symbolic data. This work focuses on the symbolic approach, bringing to music cognition some technologies, like the stochastic language models, already successfully applied to text categorisation. The representation chosen here is to model chord progressions as n-grams and strings and then apply perplexity and naiumlve Bayes classifiers, respectively, in order to assess how often those structures are found in the target genres. Some genres and sub-genres among popular, jazz, and academic music have been considered, trying to investigate how far can we reach using harmonic information with these models. The results at different leve! ls of the genre hierarchy for the techniques employed are presented and discussed.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The most probable string: an algorithmic study

  • Higuera, Colin de la
  • Oncina, Jose
The problem of finding the consensus (most probable string) for a distribution generated by a weighted finite automaton or a probabilistic grammar is related to a number of important questions: computing the distance between two distributions or finding the best translation (the most probable one) given a probabilistic finite state transducer. The problem is undecidable with general weights and is NP-hard if the automaton is probabilistic. We give a pseudo-polynomial algorithm that solves a decision problem directly associated with the consensus string and answers if there is a (reasonably short) string whose probability is larger than a given bound in time polynomial in the the size of this bound, both for probabilistic finite automata and probabilistic context-free grammars. We also study a randomized algorithm solving the same problem. Finally, we report links between the length of the consensus string and the probability of this string.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Melody characterization by a genetic fuzzy system

  • Ponce de León Amador, Pedro José
  • Rizo, David
  • Ramírez, Rafael
  • Iñesta, José M.
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Ponce de León Amador, Pedro José|||/items/9301f92f-611c-4636-a5c2-89fcfbe35694
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
We present preliminary work on automatic human-readable melody characterization. In order to obtain such a characterization, we (1) extract a set of statistical descriptors from the tracks in a dataset of MIDI files, (2) apply a rule induction algorithm to obtain a set of (crisp) classification rules for melody track identification, and (3) automatically transform the crisp rules into fuzzy rules by applying a genetic algorithm to generate the membership functions for the rule attributes. Some results are presented and discussed.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Interactive structured output prediction: application to chromosome classification

  • Oncina, Jose
  • Vidal Ruiz, Enrique
Interactive Pattern Recognition concepts and techniques are applied to problems with structured output; i.e., problems in which the result is not just a simple class label, but a suitable structure of labels. For illustration purposes (a simplification of) the problem of Human Karyotyping is considered. Results show that a) taking into account label dependencies in a karyogram significantly reduces the classical (non-interactive) chromosome label prediction error rate and b) they are further improved when interactive processing is adopted.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Multiple fundamental frequency estimation using Gaussian smoothness

  • Pertusa, Antonio
  • Iñesta, José M.
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Pertusa, Antonio|||/items/3bf633ff-4d49-4aaa-a004-abcf6fed3540
The goal of a polyphonic music transcription system is to extract a score from an audio signal. A multiple fundamental frequency estimator is the main piece of these systems, whereas tempo detection and key estimation complement them to correctly extract the score. In this work, in order to detect the fundamental frequencies that are present in a signal, a set of candidates are selected from the spectrum, and all their possible combinations are generated. The best combination is chosen in a frame by frame analysis by applying a set of rules, taking into account the harmonic amplitudes and the spectral smoothness measure described in this work. The system was evaluated and compared to other works, yielding competitive results and performance.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A ground-truth experiment on melody genre recognition in absence of timbre

  • Iñesta, José M.
  • Ponce de León Amador, Pedro José
  • Heredia Agoiz, José Luis
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Ponce de León Amador, Pedro José|||/items/9301f92f-611c-4636-a5c2-89fcfbe35694
Music genre or style is an important metadata for music collections and database organization. Some authors claim for the need of having ground truth studies on this particular topic, in order to compare results with them and lead to sound conclusions when analyzing software performances. When dealing with digital scores in any format, timbrical information is not always available or trustworthy so we have avoided this information in our computer models, using only melodic information. The main goal of this work is to assess the human ability for recognizing music genres in absence of timbre in order to assess comparatively the performance of computer models for this task. For this, we have experimented with fragments of melodies in absence of accompaniment and timbre, as our computer models do. For this particular paper we have worked with two well-stablished genres in the music literature, like classical and jazz music. A number of analyses in terms of age, group, education, and music studies of the people subjected to the tests have been performed. The results show that, on average, the error rate was about 18%. This value shows the base line to be improved for computer systems in this task without using timbrical information.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Learning to analyse tonal music

  • Illescas, Plácido R.
  • Rizo, David
  • Iñesta, José M.
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
This work is an effort towards the development of a system for the automation of traditional tonal analysis of polyphonic scores in symbolic format. The system detects chords with their tonal functions, and key changes. All the possible tonal and key analyses are represented as a weighted directed acyclic graph. The best analysis is the path that maximizes, through a dynamic programming algorithm, the sum of weights in the graph. The selection of the weights according to the importance of each possible harmonic progression is a key issue. A genetic algorithm is proposed to learn them from a training corpus of a given music style. The proof of concept of this approach has been tested on Bach chorales.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Audio music classification using a combination of spectral, timbral, rhythmic, temporal and symbolic features

  • Lidy, Thomas
  • Rauber, Andreas
  • Pertusa, Antonio
  • Ponce de León Amador, Pedro José
  • Iñesta, José M.
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Pertusa, Antonio|||/items/3bf633ff-4d49-4aaa-a004-abcf6fed3540
  • Ponce de León Amador, Pedro José|||/items/9301f92f-611c-4636-a5c2-89fcfbe35694
The novel approach of combining audio and symbolic features for music classification from audio enhanced previous audio-only based results in MIREX 2007. We extended the approach by including temporal audio features, enhancing the polyphonic audio to MIDI transcription system and including an extended set of symbolic features. Recent research in music genre classification hints at a glass ceiling being reached using timbral audio features.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Optimum algorithm to minimize human interactions in sequential Computer Assisted Pattern Recognition

  • Oncina, Jose
Given a Pattern Recognition task, Computer Assisted Pattern Recognition can be viewed as a series of solution proposals made by a computer system, followed by corrections made by a user, until an acceptable solution is found. For this kind of systems, the appropriate measure of performance is the expected number of corrections the user has to make. In the present work we study the special case when the solution proposals have a sequential nature. Some examples of this type of tasks are: language translation, speech transcription and handwriting text transcription. In all these cases the output (the solution proposal) is a sequence of symbols. In this framework it is assumed that the user corrects always the first error found in the proposed solution. As a consequence, the prefix of the proposed solution before the last error correction can be assumed error free in the next iteration. Nowadays, all the techniques in the literature relies in proposing, at each step, the most probable suffix given that a prefix of the ‘‘correct” output is already known. Usually the computation of the conditional most probable output is an NP-Hard or an undecidable problem (and then we have to apply some approximations) or, in some simple cases, complex dynamic programming techniques should be used (usually some variant of the Viterbi algorithm). In the present work we show that this strategy is not optimum when we are interested in minimizing the number of human interactions. Moreover we describe the optimum strategy that is simpler (and usually faster) to compute.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Melody recognition with learned edit distances

  • Habrard, Amaury
  • Iñesta, José M.
  • Rizo, David
  • Sebban, Marc
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
In a music recognition task, the classification of a new melody is often achieved by looking for the closest piece in a set of already known prototypes. The definition of a relevant similarity measure becomes then a crucial point. So far, the edit distance approach with a-priori fixed operation costs has been one of the most used to accomplish the task. In this paper, the application of a probabilistic learning model to both string and tree edit distances is proposed and is compared to a genetic algorithm cost fitting approach. The results show that both learning models outperform fixed-costs systems, and that the probabilistic approach is able to describe consistently the underlying melodic similarity model.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Classifying melodies using tree grammars

  • Bernabeu Briones, José Francisco
  • Calera Rubio, Jorge
  • Iñesta, José M.
  • Calera Rubio, Jorge|||/items/525d794e-97ee-4788-abab-e6b6b6c247b7
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
Similarity computation is a difficult issue in music information retrieval, because it tries to emulate the special ability that humans show for pattern recognition in general, and particularly in the presence of noisy data. A number of works have addressed the problem of what is the best representation for symbolic music in this context. The tree representation, using rhythm for defining the tree structure and pitch information for leaf and node labeling has proven to be effective in melodic similarity computation. In this paper we propose a solution when we have melodies represented by trees for the training but the duration information is not available for the input data. For that, we infer a probabilistic context-free grammar using the information in the trees (duration and pitch) and classify new melodies represented by strings using only the pitch. The case study in this paper is to identify a snippet query among a set of songs stored in symbolic format. For it, the utilized method must be able to deal with inexact queries and efficient for scalability issues.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Ensemble of state-of-the-art methods for polyphonic music comparison

  • Rizo, David
  • Iñesta, José M.
  • Lemström, Kjell
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
Content-based music comparison is a task where no musical similarity measure can perform well in all possible cases. In this paper we will show that a careful combination of different similarity measures in an ensemble measure, will behave more robust than any of the included individual measures when applied as stand-alone measures. For the experiments we have used five state-of-the-art polyphonic similarity measures and three different corpora of polyphonic music.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Query parsing using probabilistic tree grammars

  • Bernabeu Briones, José Francisco
  • Calera Rubio, Jorge
  • Iñesta, José M.
  • Rizo, David
  • Calera Rubio, Jorge|||/items/525d794e-97ee-4788-abab-e6b6b6c247b7
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
The tree representation, using rhythm for defining the tree structure and pitch information for node labeling has proven to be effective in melodic similarity computation. In this paper we propose a solution representing melodies by tree grammars. For that, we infer a probabilistic context-free grammars for the melodies in a database, using their tree coding (with duration and pitch) and classify queries represented as a string of pitches. We aim to assess their ability to identify a noisy snippet query among a set of songs stored in symbolic format.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

MirBot: A Multimodal Interactive Image Retrieval System

  • Pertusa, Antonio
  • Gallego, Antonio-Javier
  • Bernabeu, Marisa
  • Gallego, Antonio-Javier|||/items/8f865afc-8f63-4e0d-9408-bebc7ba836d0
  • Pertusa, Antonio|||/items/3bf633ff-4d49-4aaa-a004-abcf6fed3540
This study presents a multimodal interactive image retrieval system for smartphones (MirBot). The application is designed as a collaborative game where users can categorize photographs according to the WordNet hierarchy. After taking a picture, the region of interest of the target can be selected, and the image information is sent with a set of metadata to a server in order to classify the object. The user can validate the category proposed by the system to improve future queries. The result is a labeled database with a structure similar to ImageNet, but with contents selected by the users, fully marked with regions of interest, and with novel metadata that can be useful to constrain the search space in a future work. The MirBot app is freely available on the Apple app store.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A probabilistic approach to melodic similarity

  • Bernabeu Briones, José Francisco
  • Calera Rubio, Jorge
  • Iñesta, José M.
  • Rizo, David
  • Calera Rubio, Jorge|||/items/525d794e-97ee-4788-abab-e6b6b6c247b7
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
Melodic similarity is an important research topic in music information retrieval. The representation of symbolic music by means of trees has proven to be suitable in melodic similarity computation, because they are able to code rhythm in their structure leaving only pitch representations as a degree of freedom for coding. In order to compare trees, different edit distances have been previously used. In this paper, stochastic k-testable tree-models, formerly used in other domains like structured document compression or natural language processing, have been used for computing a similarity measure between melody trees as a probability and their performance has been compared to a classical tree edit distance.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Efficient methods for joint estimation of multiple fundamental frequencies in music signals

  • Pertusa, Antonio
  • Iñesta, José M.
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Pertusa, Antonio|||/items/3bf633ff-4d49-4aaa-a004-abcf6fed3540
This study presents efficient techniques for multiple fundamental frequency estimation in music signals. The proposed methodology can infer harmonic patterns from a mixture considering interactions with other sources and evaluate them in a joint estimation scheme. For this purpose, a set of fundamental frequency candidates are first selected at each frame, and several hypothetical combinations of them are generated. Combinations are independently evaluated, and the most likely is selected taking into account the intensity and spectral smoothness of its inferred patterns. The method is extended considering adjacent frames in order to smooth the detection in time, and a pitch tracking stage is finally performed to increase the temporal coherence. The proposed algorithms were evaluated in MIREX contests yielding state of the art results with a very low computational burden.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Stochastic text models for music categorization

  • Pérez-Sancho, Carlos
  • Rizo, David
  • Iñesta, José M.
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Pérez-Sancho, Carlos|||/items/d0da1799-8c21-428f-bca1-e322b025fe2f
  • Rizo, David|||/items/447626c0-6412-451c-8f26-b4a244418da2
Music genre meta-data is of paramount importance for the organization of music repositories. People use genre in a natural way when entering a music store or looking into music collections. Automatic genre classification has become a popular topic in music information retrieval research. This work brings to symbolic music recognition some technologies, like the stochastic language models, already successfully applied to text categorization. In this work we model chord progressions and melodies as n-grams and strings and then apply perplexity and naïve Bayes classifiers, respectively, in order to assess how often those structures are found in the target genres. Also a combination of the different techniques as an ensemble of classifiers is proposed. Some genres and sub-genres among popular, jazz, and academic music have been considered. The results show that the ensemble is a good trade-off approach able to perform well without the risk of choosing the wrong classifier.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Note onset detection using one semitone filter-bank for MIREX 2009

  • Pertusa, Antonio
  • Iñesta, José M.
  • Iñesta, José M.|||/items/4c7c78fb-09ed-43c3-a8ea-0c16445669d0
  • Pertusa, Antonio|||/items/3bf633ff-4d49-4aaa-a004-abcf6fed3540
The presented onset detection approach is a very simple method described in (Pertusa et al. LNCS 3773, 2005). An implementation in D2K was already submitted for MIREX 2005, yielding a relatively low success rate. However, probably there were some problems in the evaluation, as the mean distance between the detected and actual onsets was too high (about -22 ms). Therefore, the system has been reimplemented in C++ and submitted again for evaluation. The methodology and parameters are the same than those described in (Pertusa et al. LNCS 3773, 2005) and (MIREX 2005). The source code has also been released 1 for research purposes.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Experimental analysis of insertion costs in a naïve dynamic MDF-tree

  • Micó, Luisa
  • Oncina, Jose
Similarity search is a widely employed technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, the majority of the proposed techniques are static, that is, a fixed training set is used to build up the index. This characteristic becomes a major problem when these techniques are used in dynamic (interactive) systems. In these systems updating the training set is necessary to improve its performance. In this work, we explore the surprising efficiency of a naïve algorithm that allows making incremental insertion in a previously known index: the MDF-tree.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Efficient search supporting several similarity queries by reordering pivots

  • Socorro Llanes, Raisa
  • Micó, Luisa
  • Oncina, Jose
Effective similarity search indexing in general metric spaces has traditionally received special attention in several areas of interest like pattern recognition, computer vision or information retrieval. A typical method is based on the use of a distance as a dissimilarity function (not restricting to Euclidean distance) where the main objective is to speed up the search of the most similar object in a database by minimising the number of distance computations. Several types of search can be defined, being the k-nearest neigh-bour or the range search the most common. AESA is one of the most well known of such algorithms due to its performance (measured in distance computations). PiAESA is an AESA variant where the main objective has changed. Instead of trying to find the best nearest neighbour candidate at each step, it tries to find the object that contributes the most to have a bigger lower bound function, that is, a better estimation of the distance. In this paper we extend and test PiAESA to support several similarity queries. Our empirical results show that this approach obtains a significant improvement in performance when comparing with competing algorithms.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A fast pivot-based indexing algorithm for metric spaces

  • Socorro Llanes, Raisa
  • Micó, Luisa
  • Oncina, Jose
This work focus on fast nearest neighbor (NN) search algorithms that can work in any metric space (not just the Euclidean distance) and where the distance computation is very time consuming. One of the most well known methods in this field is the AESA algorithm, used as baseline for performance measurement for over twenty years. The AESA works in two steps that repeats: first it searches a promising candidate to NN and computes its distance (approximation step), next it eliminates all the unsuitable NN candidates in view of the new information acquired in the previous calculation (elimination step). This work introduces the PiAESA algorithm. This algorithm improves the performance of the AESA algorithm by splitting the approximation criterion: on the first iterations, when there is not enough information to find good NN candidates, it uses a list of pivots (objects in the database) to obtain a cheap approximation of the distance function. Once a good approximation is obtained it switches to the AESA usual behavior. As the pivot list is built in preprocessing time, the run time of PiAESA is almost the same than the AESA one. In this work, we report experiments comparing with some competing methods. Our empirical results show that this new approach obtains a significant reduction of distance computations with no execution time penalty.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A stochastic approach to median string computation

  • Olivares Rodríguez, Cristian
  • Oncina, Jose
Due to its robustness to outliers, many Pattern Recognition algorithms use the median as a representative of a set of points. A special case arises in Syntactical Pattern Recognition when the points (prototypes) are represented by strings. However, when the edit distance is used, finding the median becomes a NP-Hard problem. Then, either the search is restricted to strings in the data (set-median) or some heuristic approach is applied. In this work we use the (conditional) stochastic edit distance instead of the plain edit distance. It is not yet known if in this case the problem is also NP-Hard so an approximation algorithm is described. The algorithm is based on the extension of the string structure to multistrings (strings of stochastic vectors where each element represents the probability of each symbol) to allow the use of the Expectation Maximization technique. We carry out some experiments over a chromosomes corpus to check the efficiency of the algorithm.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Combining Multiple Hypothesis Testing with Machine Learning Increases the Statistical Power of Genome-wide Association Studies

  • Mieth, Bettina
  • Rodríguez-Pérez, Juan Antonio
  • Morcillo-Suárez, Carlos
  • Farré, Xavier
  • Navarro, Arcadi
  • Müller, Klaus-Robert
Mieth, Bettina et al., The standard approach to the analysis of genome-wide association studies (GWAS) is based on testing each position in the genome individually for statistical significance of its association with the phenotype under investigation. To improve the analysis of GWAS, we propose a combination of machine learning and statistical testing that takes correlation structures within the set of SNPs under investigation in a mathematically well-controlled manner into account. The novel two-step algorithm, COMBI, first trains a support vector machine to determine a subset of candidate SNPs and then performs hypothesis tests for these SNPs together with an adequate threshold correction. Applying COMBI to data from a WTCCC study (2007) and measuring performance as replication by independent GWAS published within the 2008–2015 period, we show that our method outperforms ordinary raw p-value thresholding as well as other state-of-the-art methods. COMBI presents higher power and precision than the examined alternatives while yielding fewer false (i.e. non-replicated) and more true (i.e. replicated) discoveries when its results are validated on later GWAS studies. More than 80% of the discoveries made by COMBI upon WTCCC data have been validated by independent studies. Implementations of the COMBI method are available as a part of the GWASpi toolbox 2.0., EF acknowledges support from the advanced ERC grant (ERC-2011-AdG 295642-FEP) on the Foundation of Economic Preferences. MK, BM, and KRM were supported by the German National Science Foundation (DFG) under the grants MU 987/6-1 and RA 1894/1-1. TD and DS were supported by the German National Science Foundation (DFG) under the grants DI 1723/3-1 und SCHU 2828/2-1. GB and TS acknowledge support of the German National Science Foundation (DFG) under the research group grant FOR 1735. MK, DT, KRM, and GB acknowledge financial support by the FP7-ICT Programme of the European Community, under the PASCAL2 Network of Excellence. MK acknowledges a postdoctoral fellowship by the German Research Foundation (DFG), award KL 2698/2-1, and from the Federal Ministry of Science and Education (BMBF) awards 031L0023A and 031B0187B. AN acknowledges support from the Spanish Multiple Sclerosis Network (REEM), of the Instituto de Salud Carlos III (RD12/0032/0011), the Spanish National Institute for Bioinformatics (PT13/0001/0026) the Spanish Government Grant BFU2012-38236 and from FEDER. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 634143 (MedBioinformatics). MK and KRM were financially supported by the Ministry of Education, Science, and Technology, through the National Research Foundation of Korea under Grant R31-10008 (MK, KRM) and BK21 (KRM)., Peer reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Learning probabilistic automata : a study in state distinguishability

  • Balle Pigem, Borja de
  • Castro Rabal, Jorge|||0000-0002-1390-1313
  • Gavaldà Mestre, Ricard|||0000-0003-4736-7179
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability μ of the target machine, besides the number of states and the usual accuracy and confidence parameters. We show that the dependence on μ is necessary in the worst case for every algorithm whose structure resembles existing ones. As a technical tool, a new variant of Statistical Queries termed View the MathML source-queries is defined. We show how to simulate View the MathML source-queries using classical Statistical Queries and show that known PAC algorithms for learning PDFA are in fact statistical query algorithms. Our results include a lower bound: every algorithm to learn PDFA with queries using a reasonable tolerance must make Ω(1/μ1−c) queries for every c>0. Finally, an adaptive algorithm that PAC-learns w.r.t. another measure of complexity is described. This yields better efficiency in many cases, while retaining the same inevitable worst-case behavior. Our algorithm requires fewer input parameters than previously existing ones, and has a better sample bound., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Mining frequent closed rooted trees

  • Balcázar Navarro, José Luis|||0000-0003-4248-4528
  • Bifet Figuerol, Albert Carles
  • Lozano Boixadors, Antoni|||0000-0002-3633-063X
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There exists a well-studied process of closure-based data mining in the itemset framework: we consider the extension of this process into trees. We focus mostly on the case where labels on the nodes are nonexistent or unreliable, and discuss algorithms for closurebased mining that only rely on the root of the tree and the link structure. We provide a notion of intersection that leads to a deeper understanding of the notion of support-based closure, in terms of an actual closure operator. We describe combinatorial characterizations and some properties of ordered trees, discuss their applicability to unordered trees, and rely on them to design efficient algorithms for mining frequent closed subtrees both in the ordered and the unordered settings. Empirical validations and comparisons with alternative algorithms are provided.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Zipf's law for word frequencies: Word forms versus lemmas in long texts

  • Corral, Alvaro
  • Boleda Torrent, Gemma
  • Ferrer Cancho, Ramon|||0000-0002-7820-923X
Zipf's law is a fundamental paradigm in the statistics of written and spoken natural language as well as in other communication systems. We raise the question of the elementary units for which Zipf's law should hold in the most natural way, studying its validity for plain word forms and for the corresponding lemma forms. We analyze several long literary texts comprising four languages, with different levels of morphological complexity. In all cases Zipf's law is fulfilled, in the sense that a power-law distribution of word or lemma frequencies is valid for several orders of magnitude. We investigate the extent to which the word-lemma transformation preserves two parameters of Zipf's law: the exponent and the low-frequency cut-off. We are not able to demonstrate a strict invariance of the tail, as for a few texts both exponents deviate significantly, but we conclude that the exponents are very similar, despite the remarkavble transformation that going from words to lemmas represents, considerably affecting all ranges of frequencies. In contrast, the low-frequency cut-offs are less stable, tending to increase substantially after the transformation., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Learning probabilistic automata : a study in state distinguishability

  • Balle Pigem, Borja de
  • Castro Rabal, Jorge
  • Gavaldà Mestre, Ricard
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability μ of the target machine, besides the number of states and the usual accuracy and confidence parameters. We show that the dependence on μ is necessary in the worst case for every algorithm whose structure resembles existing ones. As a technical tool, a new variant of Statistical Queries termed View the MathML source-queries is defined. We show how to simulate View the MathML source-queries using classical Statistical Queries and show that known PAC algorithms for learning PDFA are in fact statistical query algorithms. Our results include a lower bound: every algorithm to learn PDFA with queries using a reasonable tolerance must make Ω(1/μ1−c) queries for every c>0. Finally, an adaptive algorithm that PAC-learns w.r.t. another measure of complexity is described. This yields better efficiency in many cases, while retaining the same inevitable worst-case behavior. Our algorithm requires fewer input parameters than previously existing ones, and has a better sample bound., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Mining frequent closed rooted trees

  • Balcázar Navarro, José Luis
  • Bifet Figuerol, Albert Carles
  • Lozano Boixadors, Antoni
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There exists a well-studied process of closure-based data mining in the itemset framework: we consider the extension of this process into trees. We focus mostly on the case where labels on the nodes are nonexistent or unreliable, and discuss algorithms for closurebased mining that only rely on the root of the tree and the link structure. We provide a notion of intersection that leads to a deeper understanding of the notion of support-based closure, in terms of an actual closure operator. We describe combinatorial characterizations and some properties of ordered trees, discuss their applicability to unordered trees, and rely on them to design efficient algorithms for mining frequent closed subtrees both in the ordered and the unordered settings. Empirical validations and comparisons with alternative algorithms are provided., Postprint (author’s final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

First-order vs. higher-order modification in distributional semantics

  • Boleda, Gemma
  • Vecchi, Eva Maria
  • Cornudella Gaya, Miquel
  • McNally, Louise, 1965-
Comunicació presentada a Empirical Methods in Natural Language Processing and Computational Natural Language Learning, celebrada del 12 al 14 de juliol de 2012, a Jeju Island, Korea., Adjectival modification, particularly by expressions that have been treated as higher-order modifiers in the formal semantics tradition, raises interesting challenges for semantic composition in distributional semantic models. We contrast three types of adjectival modifiers -- intersectively used color terms (as in white towel, clearly first-order), subsectively used color terms (white wine, which have been modeled as both first- and higher-order), and intensional adjectives (former bassist, clearly higher-order) -- and test the ability of different composition strategies to model their behavior. In addition to opening up a new empirical domain for research on distributional semantics, our observations concerning the attested vectors for the different types of adjectives, the nouns they modify, and the resulting noun phrases yield insights into modification that have been little evident in the formal semantics literature to date., This research was funded by the Spanish MICINN (FFI2010-09464-E, FFI2010-15006, TIN2009-14715-C04-04), the Catalan AGAUR (2010BPA00070), and the EU (PASCAL2; FP7-ICT-216886). Eva Maria Vecchi was partially funded by ERC Starting Grant 283554.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Intensionality was only alleged: on adjective-noun composition in distributional semantics

  • Boleda, Gemma
  • Baroni, Marco
  • Pham, Nghia The
  • McNally, Louise, 1965-
Distributional semantics has very successfully modeled semantic phenomena at the word level, and recently interest has grown in extending it to capture the meaning of phrases via semantic composition. We present experiments in adjective-noun composition which (1) show that adjectival modification can be successfully modeled with distributional semantics, (2) show that composition models inspired by the semantics of higher-order predication fare better than those that perform simple feature union or intersection, (3) contrary to what the theoretical literature might lead one to expect, do not yield a distinction between intensional and non-intensional modification, and (4) suggest that head noun polysemy and whether the adjective corresponds to a typical attribute of the noun are relevant factors in the distributional representation of adjective phrases., We acknowledge the support of Spanish MICINN grant FFI2010-09464-E (McNally, Boleda), the ICREA Foundation (McNally), Catalan AGAUR grant 2010BP-A00070, MICINN grant TIN2009-14715-C04-04, EU grant PASCAL2, FP7-ICT-216886, the DARPA DEFT program under AFRL grant FA8750-13-2-0026 (Boleda) and the ERC under the 2011 Starting Independent Research Grant 283554 to the COMPOSES project (Baroni, Pham). Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the view of DARPA, AFRL or the US government.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Adjectives as saturators vs. modifiers: statistical evidence

  • McNally, Louise, 1965-
  • Boleda, Gemma
  • Evert, Stefan
  • Gehrke, Berit
This paper reports on a large-scale, statistical analysis of corpus data to support the null hypothesis that ethnic adjectives (EAs, e.g. French) are ordinary adjectives, rather than argument-saturating \nouns in disguise" (in, e.g., French agreement). In particular, EAs are argued to simply modify the noun they combine with; their special properties in inducing argument-like behavior arises from the interaction between the semantics of event nominals and that of the adjective., This work was supported by grants from the Spanish Ministry of Science and Innovation (FFI2010-15006, TIN2009-14715-C04-04 (KNOW-II), JCI-2010-08581), as well as by the European Union via the EU PASCAL2 Network of Excellence (FP7-ICT-216886) and by the Fundació ICREA.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Zipf's law for word frequencies: Word forms versus lemmas in long texts

  • Corral, Alvaro
  • Boleda Torrent, Gemma
  • Ferrer Cancho, Ramon
Zipf's law is a fundamental paradigm in the statistics of written and spoken natural language as well as in other communication systems. We raise the question of the elementary units for which Zipf's law should hold in the most natural way, studying its validity for plain word forms and for the corresponding lemma forms. We analyze several long literary texts comprising four languages, with different levels of morphological complexity. In all cases Zipf's law is fulfilled, in the sense that a power-law distribution of word or lemma frequencies is valid for several orders of magnitude. We investigate the extent to which the word-lemma transformation preserves two parameters of Zipf's law: the exponent and the low-frequency cut-off. We are not able to demonstrate a strict invariance of the tail, as for a few texts both exponents deviate significantly, but we conclude that the exponents are very similar, despite the remarkavble transformation that going from words to lemmas represents, considerably affecting all ranges of frequencies. In contrast, the low-frequency cut-offs are less stable, tending to increase substantially after the transformation., Peer Reviewed, Postprint (published version)