Pawan Deshpande

Pawan Deshpande

San Francisco Bay Area
7K followers 500+ connections

About

Growth-oriented & cross-functional former founder with strong product skills…

Articles by Pawan

See all articles

Contributions

Activity

Experience

  • Galileo 🔭 Graphic

    Galileo 🔭

    San Francisco, California, United States

  • -

  • -

    San Francisco Bay Area

  • -

    San Francisco, California, United States

  • -

    San Francisco Bay Area

  • -

    Greater Boston Area

  • -

    Mountain View, CA & Bangalore, India

  • -

    Greater Seattle Area

  • -

    Greater Boston Area

  • -

    Greater Boston Area

  • -

    Greater Boston Area

  • -

    Greater Boston Area

Education

  • Massachusetts Institute of Technology Graphic

    Massachusetts Institute of Technology

    Chorafas Thesis Prize (International), &
    Charles & Jennifer Johnson Award for Outstanding Thesis in Computer Science (Departmental)

  • Activities and Societies: Varsity Wrestling

  • Activities and Societies: Wrestling

Publications

  • Your Facebook data is still vulnerable. I know because I made it that way.

    Washington Post

    Op-Ed about a major active Facebook privacy vulnerability based on my patent filing.

    See publication
  • Race and colorism in education

    Routledge

    Co-authored chapter "De-hue-manizing them : color and acculturation among second-generation South Asians". Sailaja N. Joshi, Murali Balaji, and Pawan Deshpande

    Other authors
    See publication
  • Decoding Algorithms for Complex Natural Language Tasks

    Massachusetts Institute of Technology

    This thesis focuses on developing decoding techniques for complex Natural Language Processing (NLP) tasks. The goal of decoding is to find an optimal or near optimal solution given a model that defines the goodness of a candidate. The task is challenging because in a typical problem the search space is large, and the dependencies between elements of the solution are complex.

    See publication
  • Generating a Table-of-Contents

    Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics

    This paper presents a method for the automatic generation of a table-of-contents. This type of summary could serve as an effective navigation tool for accessing information in long texts, such as books. To generate a coherent table-of-contents, we need to capture both global dependencies across different titles in the table and local constraints within sections. Our algorithm effectively handles these complex dependencies by factoring the model into local and global components, and…

    This paper presents a method for the automatic generation of a table-of-contents. This type of summary could serve as an effective navigation tool for accessing information in long texts, such as books. To generate a coherent table-of-contents, we need to capture both global dependencies across different titles in the table and local constraints within sections. Our algorithm effectively handles these complex dependencies by factoring the model into local and global components, and incrementally constructing the model's output. The results of automatic evaluation and manual assessment confirm the benefits of this design: our system is consistently ranked higher than non-hierarchical baselines.

    Other authors
    See publication
  • Randomized Decoding for Selection-and-Ordering Problems

    North American Chapter of the Association for Computational Linguistics (NAACL)

    The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline by selecting and ordering words from the input text. In this paper, we investigate decoding methods that simultaneously optimize selection and ordering preferences. We formalize decoding as a task of finding an acyclic path in a directed weighted graph. Since the problem is NP-hard, finding an exact solution is…

    The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline by selecting and ordering words from the input text. In this paper, we investigate decoding methods that simultaneously optimize selection and ordering preferences. We formalize decoding as a task of finding an acyclic path in a directed weighted graph. Since the problem is NP-hard, finding an exact solution is challenging. We describe a novel decoding method based on a randomized color-coding algorithm. We prove bounds on the number of color-coding iterations necessary to guarantee any desired likelihood of finding the correct solution. Our experiments show that the randomized decoder is an appealing alternative to a range of decoding algorithms for selection-and-ordering problems, including beam search and Integer Linear Programming.

    Other authors
    See publication
  • Finding Temporal Order in Discharge Summaries

    American Medical Informatics Association Annual (AMIA) Symposium Proceedings

    A method for automatic analysis of time-oriented clinical narratives would be of significant practical import for medical decision making, data modeling and biomedical research. This paper proposes a robust corpus-based approach for temporal analysis of medical discharge summaries. We characterize temporal organization of clinical narratives in terms of temporal segments and their ordering. We consider a temporal segment to be a fragment of text that does not exhibit abrupt changes in temporal…

    A method for automatic analysis of time-oriented clinical narratives would be of significant practical import for medical decision making, data modeling and biomedical research. This paper proposes a robust corpus-based approach for temporal analysis of medical discharge summaries. We characterize temporal organization of clinical narratives in terms of temporal segments and their ordering. We consider a temporal segment to be a fragment of text that does not exhibit abrupt changes in temporal focus. Our method derives temporal order based on a range of linguistic and contextual features that are integrated in a supervised machine-learning framework. Our learning method achieves 83% F-measure in temporal segmentation, and 78.3% accuracy in inferring pairwise temporal relations.

    Other authors
    See publication
  • Inducing Temporal Graphs

    Proceedings of the Conference on Empirical Methods on Natural Language Processing (EMNLP)

    We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of text that maintains temporal coherence. The strength of our approach lies in its ability to simultaneously optimize pairwise ordering preferences and global constraints on the graph topology. Our learning method achieves 83% F-measure in temporal segmentation and 84% accuracy in inferring temporal relations between two…

    We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of text that maintains temporal coherence. The strength of our approach lies in its ability to simultaneously optimize pairwise ordering preferences and global constraints on the graph topology. Our learning method achieves 83% F-measure in temporal segmentation and 84% accuracy in inferring temporal relations between two segments.

    Other authors
    See publication

Patents

  • Machine Learning For Transliteration

    Issued US US US2008/0221866 A1

    Methods, systems, and apparatus, including computer program products, for performing transliteration between text in different scripts. In one aspect, a method includes generating a transliteration model based on statistical information derived from parallel text having first text in an input script and corresponding second text in an output script; and using the transliteration model to transliterate input characters in the input script to output characters in the output script. In another…

    Methods, systems, and apparatus, including computer program products, for performing transliteration between text in different scripts. In one aspect, a method includes generating a transliteration model based on statistical information derived from parallel text having first text in an input script and corresponding second text in an output script; and using the transliteration model to transliterate input characters in the input script to output characters in the output script. In another aspect, a method includes performing word level transliterations. In another aspect, a method includes using an entry-aligned dictionary of source and target script pairs, in which, whenever a particular source word is mapped to multiple target words, the dictionary includes an entry for each target word including the same source word repeated in each entry. In another aspect, a method includes using phonetic scores of words in different scripts to identify corresponding parallel text.

    Other inventors
    See patent
  • Systems and methods for recommendation of personal network

    Issued US US 2006/0074932 A1

    Systems and methods for automatically recommending a personal network. The systems can include a review module programmed to review communication information. The systems can also include a recommend module in data communication with the review module, the recommend module being programmed to identify one or more contacts from the communication information to be included in a personal network. The recommend module can use a significance function to weight the communication information and rank…

    Systems and methods for automatically recommending a personal network. The systems can include a review module programmed to review communication information. The systems can also include a recommend module in data communication with the review module, the recommend module being programmed to identify one or more contacts from the communication information to be included in a personal network. The recommend module can use a significance function to weight the communication information and rank the contacts identified in the communication information.

    Other inventors
    See patent

Honors & Awards

  • Boston Business Journal 40 Under 40

    Boston Business Journal

    Awarded in 2010

  • Gartner Cool Vendor

    Gartner

    Awarded in 2015

  • MarketingProfs Bright Bulb Awards B2B Marketer of the Year (Finalist)

    MarketingProfs

    Awarded in 2014

  • Leader in Content Marketing Software

    G2Crowd

  • EContent100 Digital Content Companies that Matter the Most

    EContent Magazine

  • Gartner GetApp Top Performer for Content Marketing

    Gartner GetApp

  • High Performer in Content Marketing Software

    G2Crowd

  • Top 100 Content Marketing Influencers (#8)

    KPS Digital Marketing

  • Best of Show

    Social Tools Summit

  • Hot in Boston Award

    Owler

  • Best of Show

    Social Tools Summit

  • Sales & Marketing Technology of the Year (Finalist)

    Massachusetts Technology Leadership Council (MassTLC)

  • Trendsetting Product of the Year

    EContent

  • Trendsetting Product of the Year

    EContent

  • What's Next Best B2B Product 2014

    Massachusetts Innovation & Technology Exchange (MITX)

  • Consumer Product of the Year (Runner Up)

    Massachusetts Technology Leadership Council (MassTLC)

  • DemandGen Report Killer Content Award

    DemandGen Report

  • Sales & Marketing Technology of the Year

    Massachusetts Technology Leadership Council (MassTLC)

  • Charles and Jennifer Johnson Award for Outstanding Master of Engineering Thesis in Computer Science

    MIT Department of Electrical Engineering & Computer Science

  • Dimitris N. Chorafas Foundation Prize

    Dimitris N. Chorafas Foundation

Recommendations received

View Pawan’s full profile

  • See who you know in common
  • Get introduced
  • Contact Pawan directly
Join to view full profile

Other similar profiles

Explore collaborative articles

We’re unlocking community knowledge in a new way. Experts add insights directly into each article, started with the help of AI.

Explore More

Others named Pawan Deshpande

Add new skills with these courses