AVP

(redirected from Attribute-value pair)
Also found in: Wikipedia.
AcronymDefinition
AVPAvoirdupois (weight)
AVPAlien(s) Vs. Predator
AVPAssistant Vice President
AVPAssociation of Volleyball Professionals
AVPArginine Vasopressin
AVPAssociate Vice President
AVPAudio Video Presentation
AVPAnti-Violence Project
AVPanti Virus Protection
AVPAverage Voice Packet
AVPAttribute Value Pair
AVPanti Virus Package
AVPanti Viral Professional
AVPanti Virus Plug-in
AVPAdaptive Video Process
AVPAudio Visual Processor
AVPAalto Ventures Program (Espoo, Finland; education)
AVPAnti-Virus Pro (Panda)
AVPAttribute-Value Pair
AVPAvant-Projet (French: Draft; various organizations)
AVPAudio-Video Production
AVPAny Valid Point (biology examination)
AVPAdvanced Video Processor
AVPAccident sur la Voie Publique (French: Accident on Public Ways; traffic accident)
AVPAlternative to Violence Project
AVPAntiviral Protein
AVPActing Vice President (various organizations)
AVPAcademical Village People (University of Virginia a cappella group)
AVPAmbulatory Venous Pressure
AVPAdaptive Voltage Positioning
AVPArubaanse Volkspartij
AVPAnthrax Vaccination Program (US CDC)
AVPAnalysis at Various Prices
AVPAdministración de Vivienda Pública (public housing administrator, San Juan)
AVPAdult Volunteer Pool (University of Toronto; Canada)
AVPSeaplane Tender, Small (naval ship type; mine craft conversions)
AVPAmerican Volleyball Professionals
AVPAdvanced Vertical Processor (semiconductors)
AVPAuthorized Vendor Program
AVPAssociation des Volontaires de la Paix (Association of Peace Volunteers)
AVPAtlanta Vocal Project (Atlanta, GA)
AVPAssociated Video Producers (Springfield, MO)
AVPAluminium Vérandas Plaisir (French window manufacturer; Plaisir, France)
AVPAverage Wave Period
AVPAzimuth Verification Point
AVPAustralian Veterinary Practitioner (Journal)
AVPAverage Voice Packet (voice over data networks)
AVPAdaptive Video Process/ing/or
AVPApproximate Vertical Profile
AVPArmy Validation Program
AVPWilkes Barre/Scranton, PA, USA - Wilkes-Barre/Scranton International (Airport Code)
AVPARM (Atmospheric Radiation Measurement) Aerial Vehicles Program (US Department of Education)
References in periodicals archive ?
Stems whose gender value does not derive on the basis of other information contain a fully specified attribute-value pair (see [30]).
Considering features to be attribute-value pairs, entries are distinguished into two types: those characterized by a fully specified gender feature, that is, by a feature containing an attribute with a specific value part; and those that bear an underspecified gender feature, that is, an attribute without a value.
Considering features to be attribute-value pairs, it is shown that in certain stems, gender constitutes a fully specified feature, that is, a feature containing an attribute with a particular value.
The feature theory that is assumed for the purposes of this paper considers features to be attribute-value pairs. This type of feature formulation is commonly used by unification-based grammar formalisms and has been successfully implemented in several computational analyses of Greek morphology.
If we apply a similar idea to morphology, (26) and to features seen as attribute-value pairs, we could claim that an underspecified feature is one that bears an attribute without a value, and that this value is acquired by some particular process.
It should be noticed that the examples of persisting underspecification that are examined in this section argue in favor of the approach that considers features to be attribute-value pairs: a noun with a gender attribute without a particular value (e.g.
Considering features to be attribute-value pairs, entries were distinguished into two types: these characterized by a fully specified gender feature, that is, by a feature containing an attribute with a specific value part, and those that bear an underspecified gender feature, that is, an attribute without a value.
(24.) See, for example, Markopoulos (1998) and Ralli (2000b) for a computational analysis of Greek inflection where morphosyntactic information is handled with the use of features represented as attribute-value pairs.
The conjunction of all attribute-value pairs selected create a induced rule of class i
To address the problem of storing skewed attribute-value pairs, we consider using an approach called Load Balancing Matrix (LBM) originally proposed in [13] with slight alterations taking into account specifics of storing service descriptions in (a, [nu])-graph.