blank Quick help
blank Maintenance news

Scheduled maintenance

Regular maintenance outages:
between 05.00 and 05.15 hrs CET (Monday to Sunday).

Other outages
Availability
Register Forum

2022.02.11

More...
blank News flashes

News flashes

New version of the European Patent Register - SPC information for Unitary Patents.

2024-03-06

More...
blank Related links

Extract from the Register of European Patents

EP About this file: EP2137641

EP2137641 - SPEECH DATA RETRIEVAL APPARATUS, SPEECH DATA RETRIEVAL METHOD, SPEECH DATA RETRIEVAL PROGRAM AND COMPUTER USABLE MEDIUM HAVING COMPUTER READABLE SPEECH DATA RETRIEVAL PROGRAM EMBODIED THEREIN [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  09.09.2016
Database last updated on 14.06.2024
Most recent event   Tooltip17.08.2018Lapse of the patent in a contracting state
New state(s): BG
published on 19.09.2018  [2018/38]
Applicant(s)For all designated states
Massachusetts Institute of Technology
77 Massachusetts Avenue
Cambridge, MA 02139 / US
For all designated states
Nippon Telegraph and Telephone Corporation
3-1, Otemachi 2-chome Chiyoda-ku
Tokyo 100-8116 / JP
[2015/45]
Former [2010/01]For all designated states
Massachusetts Institute of Technology
77 Massachusetts Avenue
Cambridge, MA 02139 / US
For all designated states
Nippon Telegraph and Telephone Corporation
3-1, Otemachi 2-chome Chiyoda-ku
Tokyo 100-8116 / JP
Inventor(s)01 / HORI, Takaaki
c/o NTT Intellectual Property Center
9-11 Midori-cho 3-chome
Musashino-shi Tokyo 180-8585 / JP
02 / HETHERINGTON, I.Lee
c/o MIT Computer Science and Artificial
Intelligence Laboratory
32 Vassar Street
Cambridge, Massachusetts 02139 / US
03 / HAZEN, Timothy, J.
c/o MIT Computer Science and Artificial
Intelligence Laboratory
32 Vassar Street
Cambridge, Massachusetts 02139 / US
04 / GLASS, James, R.
c/o MIT Computer Science and Artificial
Intelligence Laboratory
32 Vassar Street
Cambridge, Massachusetts 02139 / US
 [2015/45]
Former [2010/01]01 / HORI, Takaaki
c/o NTT Intellectual Property Center 9-11 Midori-cho 3-chome
Musashino-shi Tokyo 180-8585 / JP
02 / HETHERINGTON, I.Lee
c/o MIT Computer Science and Artificial Intelligence Laboratory 32 Vassar Street
Cambridge, Massachusetts 02139 / US
03 / HAZEN, Timothy, J.
c/o MIT Computer Science and Artificial Intelligence Laboratory 32 Vassar Street
Cambridge, Massachusetts 02139 / US
04 / GLASS, James, R.
c/o MIT Computer Science and Artificial Intelligence Laboratory 32 Vassar Street
Cambridge, Massachusetts 02139 / US
Representative(s)Hoffmann Eitle
Patent- und Rechtsanwälte PartmbB
Arabellastraße 30
81925 München / DE
[2015/45]
Former [2010/01]HOFFMANN EITLE
Patent- und Rechtsanwälte Arabellastrasse 4
81925 München / DE
Application number, filing date08740611.211.04.2008
[2010/01]
WO2008JP57554
Priority number, dateUS20070911731P13.04.2007         Original published format: US 911731 P
[2010/01]
Filing languageEN
Procedural languageEN
PublicationType: A1 Application with search report
No.:WO2008130018
Date:30.10.2008
Language:EN
[2008/44]
Type: A1 Application with search report 
No.:EP2137641
Date:30.12.2009
Language:EN
The application published by WIPO in one of the EPO official languages on 30.10.2008 takes the place of the publication of the European patent application.
[2009/53]
Type: B1 Patent specification 
No.:EP2137641
Date:04.11.2015
Language:EN
[2015/45]
Search report(s)International search report - published on:EP30.10.2008
ClassificationIPC:G06F17/30
[2010/01]
CPC:
G06F16/60 (EP,US); G06F16/685 (EP,US)
Designated contracting statesAT,   BE,   BG,   CH,   CY,   CZ,   DE,   DK,   EE,   ES,   FI,   FR,   GB,   GR,   HR,   HU,   IE,   IS,   IT,   LI,   LT,   LU,   LV,   MC,   MT,   NL,   NO,   PL,   PT,   RO,   SE,   SI,   SK,   TR [2015/45]
Former [2010/01]AT,  BE,  BG,  CH,  CY,  CZ,  DE,  DK,  EE,  ES,  FI,  FR,  GB,  GR,  HR,  HU,  IE,  IS,  IT,  LI,  LT,  LU,  LV,  MC,  MT,  NL,  NO,  PL,  PT,  RO,  SE,  SI,  SK,  TR 
TitleGerman:VORRICHTUNG ZUM ABRUFEN GESPROCHENER DATEN, VERFAHREN ZUM ABRUFEN GESPROCHENER DATEN, PROGRAMM ZUM ABRUFEN GESPROCHENER DATEN UND COMPUTERMEDIUM MIT DARAUF GESPEICHERTEM PROGRAMM ZUM ABRUFEN GESPROCHENER DATEN[2010/01]
English:SPEECH DATA RETRIEVAL APPARATUS, SPEECH DATA RETRIEVAL METHOD, SPEECH DATA RETRIEVAL PROGRAM AND COMPUTER USABLE MEDIUM HAVING COMPUTER READABLE SPEECH DATA RETRIEVAL PROGRAM EMBODIED THEREIN[2010/01]
French:APPAREIL, PROCÉDÉ ET LOGICIEL DE DONNÉES VOCALES, ET SUPPORT INFORMATIQUE SUR LEQUEL EST ENREGISTRÉ UN TEL LOGICIEL[2010/01]
Entry into regional phase25.09.2009National basic fee paid 
25.09.2009Designation fee(s) paid 
25.09.2009Examination fee paid 
Examination procedure25.09.2009Examination requested  [2009/53]
21.12.2009Amendment by applicant (claims and/or description)
17.05.2010Despatch of a communication from the examining division (Time limit: M04)
16.09.2010Reply to a communication from the examining division
16.07.2014Despatch of a communication from the examining division (Time limit: M04)
13.11.2014Reply to a communication from the examining division
08.07.2015Communication of intention to grant the patent
22.09.2015Fee for grant paid
22.09.2015Fee for publishing/printing paid
22.09.2015Receipt of the translation of the claim(s)
Divisional application(s)The date of the Examining Division's first communication in respect of the earliest application for which a communication has been issued is  17.05.2010
Opposition(s)05.08.2016No opposition filed within time limit [2016/41]
Fees paidRenewal fee
23.03.2010Renewal fee patent year 03
28.04.2011Renewal fee patent year 04
22.03.2012Renewal fee patent year 05
15.04.2013Renewal fee patent year 06
25.03.2014Renewal fee patent year 07
27.04.2015Renewal fee patent year 08
Opt-out from the exclusive  Tooltip
competence of the Unified
Patent Court
See the Register of the Unified Patent Court for opt-out data
Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court.
Lapses during opposition  TooltipHU11.04.2008
AT04.11.2015
BE04.11.2015
BG04.11.2015
CY04.11.2015
CZ04.11.2015
DK04.11.2015
EE04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
MC04.11.2015
NL04.11.2015
PL04.11.2015
RO04.11.2015
SE04.11.2015
SI04.11.2015
SK04.11.2015
TR04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
IE11.04.2016
LU11.04.2016
CH30.04.2016
LI30.04.2016
MT30.04.2016
[2018/38]
Former [2018/32]HU11.04.2008
AT04.11.2015
BE04.11.2015
CY04.11.2015
CZ04.11.2015
DK04.11.2015
EE04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
MC04.11.2015
NL04.11.2015
PL04.11.2015
RO04.11.2015
SE04.11.2015
SI04.11.2015
SK04.11.2015
TR04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
IE11.04.2016
LU11.04.2016
CH30.04.2016
LI30.04.2016
MT30.04.2016
Former [2018/29]HU11.04.2008
AT04.11.2015
BE04.11.2015
CY04.11.2015
CZ04.11.2015
DK04.11.2015
EE04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
MC04.11.2015
NL04.11.2015
PL04.11.2015
RO04.11.2015
SE04.11.2015
SI04.11.2015
SK04.11.2015
TR04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
IE11.04.2016
LU11.04.2016
CH30.04.2016
LI30.04.2016
Former [2018/28]HU11.04.2008
AT04.11.2015
BE04.11.2015
CY04.11.2015
CZ04.11.2015
DK04.11.2015
EE04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
MC04.11.2015
NL04.11.2015
PL04.11.2015
RO04.11.2015
SE04.11.2015
SI04.11.2015
SK04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
IE11.04.2016
LU11.04.2016
CH30.04.2016
LI30.04.2016
Former [2017/38]AT04.11.2015
BE04.11.2015
CZ04.11.2015
DK04.11.2015
EE04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
NL04.11.2015
PL04.11.2015
RO04.11.2015
SE04.11.2015
SI04.11.2015
SK04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
IE11.04.2016
LU11.04.2016
CH30.04.2016
LI30.04.2016
Former [2017/07]AT04.11.2015
BE04.11.2015
CZ04.11.2015
DK04.11.2015
EE04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
NL04.11.2015
PL04.11.2015
RO04.11.2015
SE04.11.2015
SI04.11.2015
SK04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
LU11.04.2016
CH30.04.2016
LI30.04.2016
Former [2017/04]AT04.11.2015
BE04.11.2015
CZ04.11.2015
DK04.11.2015
EE04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
NL04.11.2015
PL04.11.2015
RO04.11.2015
SE04.11.2015
SI04.11.2015
SK04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
LU11.04.2016
Former [2017/03]AT04.11.2015
BE04.11.2015
CZ04.11.2015
DK04.11.2015
EE04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
NL04.11.2015
PL04.11.2015
RO04.11.2015
SE04.11.2015
SI04.11.2015
SK04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
Former [2016/49]AT04.11.2015
CZ04.11.2015
DK04.11.2015
EE04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
NL04.11.2015
PL04.11.2015
RO04.11.2015
SE04.11.2015
SI04.11.2015
SK04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
BE30.04.2016
Former [2016/39]AT04.11.2015
CZ04.11.2015
DK04.11.2015
EE04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
NL04.11.2015
PL04.11.2015
RO04.11.2015
SE04.11.2015
SK04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
BE30.04.2016
Former [2016/36]AT04.11.2015
CZ04.11.2015
EE04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
NL04.11.2015
PL04.11.2015
RO04.11.2015
SE04.11.2015
SK04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
BE30.04.2016
Former [2016/34]AT04.11.2015
CZ04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
NL04.11.2015
PL04.11.2015
SE04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
Former [2016/25]AT04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
LV04.11.2015
NL04.11.2015
PL04.11.2015
SE04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
Former [2016/24]AT04.11.2015
ES04.11.2015
FI04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
NL04.11.2015
PL04.11.2015
SE04.11.2015
NO04.02.2016
GR05.02.2016
IS04.03.2016
PT04.03.2016
Former [2016/23]ES04.11.2015
HR04.11.2015
IT04.11.2015
LT04.11.2015
NL04.11.2015
SE04.11.2015
NO04.02.2016
IS04.03.2016
Former [2016/22]ES04.11.2015
IT04.11.2015
LT04.11.2015
NL04.11.2015
NO04.02.2016
IS04.03.2016
Former [2016/21]ES04.11.2015
IT04.11.2015
LT04.11.2015
NO04.02.2016
Former [2016/20]ES04.11.2015
LT04.11.2015
Cited inInternational search[X]US2006265222  (CHELBA CIPRIAN I [US], et al) [X] 1-7 * abstract * * paragraph [0005] - paragraph [0006] * * paragraph [0021] - paragraph [0026] * * paragraph [0034] - paragraph [0074] * * figures 3-5 * * claims 1-14 *;
 [Y]EP1630705  (AT & T CORP [US]) [Y] 1-7 * abstract * * paragraph [0021] - paragraph [0035] * * figures 1,2a,2b *;
 [A]WO2005010866  (NEXIDIA INC [US], et al) [A] 1-7 * abstract * * paragraph [0028] - paragraph [0052] *;
 [X]  - CHELBA ET AL, "Soft indexing of speech content for search in spoken documents", COMPUTER SPEECH AND LANGUAGE, ELSEVIER, LONDON, GB, (20070310), vol. 21, no. 3, ISSN 0885-2308, pages 458 - 478, XP005921418 [X] 1-7 * the whole document *

DOI:   http://dx.doi.org/10.1016/j.csl.2006.09.001
 [Y]  - MANGU L ET AL, "Finding consensus in speech recognition: word error minimization and other applications of confusion networks", COMPUTER SPEECH AND LANGUAGE, ELSEVIER, LONDON, GB, (20001001), vol. 14, no. 4, ISSN 0885-2308, pages 373 - 400, XP004418725 [Y] 1-7 * abstract * * page 377 - page 394 *

DOI:   http://dx.doi.org/10.1006/csla.2000.0152
 [A]  - JIAN XUE ET AL, "Improved Confusion Network Algorithm and Shortest Path Search from Word Lattice", ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2005. PROCEEDINGS. (ICASSP ' 05). IEEE INTERNATIONAL CONFERENCE ON PHILADELPHIA, PENNSYLVANIA, USA MARCH 18-23, 2005, PISCATAWAY, NJ, USA,IEEE, (20050318), vol. 1, ISBN 978-0-7803-8874-1, pages 853 - 856, XP010792172 [A] 1-7 * the whole document *

DOI:   http://dx.doi.org/10.1109/ICASSP.2005.1415248
by applicantUS2006265222
 EP1630705
    - "Soft indexing of speech content for search in spoken documents", CHELBA ET AL., COMPUTER SPEECH AND LANGUAGE, ELSEVIER, (20070310), vol. 21, pages 458 - 478
    - "Finding consensus in speech recognition: word error minimization and other applications of confusion networks", MANGU L ET AL., COMPUTER SPEECH AND LANGUAGE, ELSEVIER, (20001001), vol. 14, pages 373 - 400
The EPO accepts no responsibility for the accuracy of data originating from other authorities; in particular, it does not guarantee that it is complete, up to date or fit for specific purposes.